Pages that link to "Item:Q4079563"
From MaRDI portal
The following pages link to One hundred and two problems in mathematical logic (Q4079563):
Displaying 50 items.
- Almost structural completeness; an algebraic approach (Q278762) (← links)
- Admissible bases via stable canonical rules (Q284230) (← links)
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) (Q385070) (← links)
- On unification and admissible rules in Gabbay-de Jongh logics (Q386639) (← links)
- An explicit basis for admissible inference rules in table modal logics of width 2 (Q431673) (← links)
- Admissibility and refutation: some characterisations of intermediate logics (Q481867) (← links)
- Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation (Q498234) (← links)
- Finite frames fail: how infinity works its way into the semantics of admissibility (Q514509) (← links)
- Modal logics with several operators and probability interpretations (Q579232) (← links)
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition (Q606997) (← links)
- Admissible rules in the implication-negation fragment of intuitionistic logic (Q638480) (← links)
- Remark on Kreisel's conjecture (Q684960) (← links)
- Surrealist landscape with figures (a survey of recent results in set theory) (Q754865) (← links)
- Temporal logic with accessibility temporal relations generated by time states themselves (Q779153) (← links)
- Classification theory for non-elementary classes. I: The number of uncountable models of \(\psi \in L_{\omega _ 1,\omega}\) (Q800911) (← links)
- Logical equations and admissible rules of inference with parameters in modal provability logics (Q805609) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Complexity of admissible rules (Q868660) (← links)
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus (Q920971) (← links)
- Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms (Q929294) (← links)
- Generalizing proofs in monadic languages (with a postscript by Georg Kreisel). (Q930260) (← links)
- Resplendent models and \({\Sigma_1^1}\)-definability with an oracle (Q944221) (← links)
- Linear temporal logic with until and next, logical consecutions (Q947268) (← links)
- Proof theory for admissible rules (Q1023055) (← links)
- Turing machine computations in finitely axiomatizable theories (Q1059628) (← links)
- Elementary theories of free topo-Boolean and pseudo-Boolean algebras (Q1076014) (← links)
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic (Q1079558) (← links)
- Bases of admissible rules of the logics S4 and Int (Q1079559) (← links)
- Equations in free topoboolean algebra (Q1092029) (← links)
- Interpretability of various extensions of arithmetic (Q1095138) (← links)
- On the number of steps in proofs (Q1119576) (← links)
- On two problems of Harvey Friedman (Q1140629) (← links)
- Example of an \(omega_ 1-\)categorical complete finitely axiomatizable theory (Q1156124) (← links)
- Splitting properties and jump classes (Q1156791) (← links)
- Iterated forcing and changing cofinalities (Q1159635) (← links)
- Admissible rules for pretable modal logics (Q1170232) (← links)
- Solvability of logical equations in the modal system Grz and intuitionistic logic (Q1177557) (← links)
- Provability interpretations of modal logic (Q1235695) (← links)
- Refuting Ehrenfeucht conjecture on rigid models (Q1238807) (← links)
- Boolean-valued set theory and forcing (Q1239728) (← links)
- Decomposing uncountable squares to countably many chains (Q1241443) (← links)
- Complexity of reals in inner models of set theory (Q1295378) (← links)
- The Kreisel length-of-proof problem (Q1353977) (← links)
- Ranks and pregeometries in finite diagrams (Q1591202) (← links)
- Anderson and Belnap's invitation to sin (Q1959326) (← links)
- Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable (Q2276947) (← links)
- Inference rules in Nelson's logics, admissibility and weak admissibility (Q2342802) (← links)
- On maximal intermediate predicate constructive logics (Q2563458) (← links)
- Description of modal logics which enjoy co-cover property (Q2676814) (← links)
- Admissible rules for six intuitionistic modal logics (Q2683779) (← links)
