Pages that link to "Item:Q1148885"
From MaRDI portal
The following pages link to Semantical investigations in Heyting's intuitionistic logic (Q1148885):
Displayed 50 items.
- If, not when (Q276029) (← links)
- Graphs of plural cuts (Q383359) (← links)
- An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
- Maximality and refutability (Q558425) (← links)
- Joint consistency in extensions of the minimal logic (Q606053) (← links)
- Interpolation and definability over the logic Gl (Q647415) (← links)
- Maximal Kripke-type semantics for modal and superintuitionistic predicate logics (Q688796) (← links)
- Interpolation and the projective Beth property in well-composed logics (Q694247) (← links)
- Decidability of the weak interpolation property over the minimal logic (Q695764) (← links)
- An intriguing logic with two implicational connectives (Q698537) (← links)
- Algebras of intervals and a logic of conditional assertions (Q704035) (← links)
- Constructive modal logics. I (Q750417) (← links)
- Simple consequence relations (Q809992) (← links)
- A first order nonmonotonic extension of constructive logic (Q813086) (← links)
- Configuration structures, event structures and Petri nets (Q843106) (← links)
- First-order logic in the Medvedev lattice (Q897478) (← links)
- \(\mathcal {BCDL}\): Basic constructive description logic (Q972431) (← links)
- Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus (Q991900) (← links)
- Predicate logical extensions of some subintuitionistic logics (Q1005979) (← links)
- Reference and perspective in intuitionistic logics (Q1006455) (← links)
- Default logic generalized and simplified (Q1028638) (← links)
- Models for normal intuitionistic modal logics (Q1096612) (← links)
- Models for stronger normal intuitionistic modal logics (Q1096613) (← links)
- A cut-free Gentzen-type system for the logic of the weak law of excluded middle (Q1100191) (← links)
- On decision procedures for sentential logics (Q1181478) (← links)
- A family of goal directed theorem provers based on conjunction and implication. I (Q1181711) (← links)
- An infinite class of maximal intermediate propositional logics with the disjunction property (Q1204112) (← links)
- Quantified extensions of canonical propositional intermediate logics (Q1207339) (← links)
- Some results on the Kripke sheaf semantics for super-intuitionistic predicate logics (Q1208117) (← links)
- On some new intuitionistic propositional connectives. I (Q1240220) (← links)
- Computable Kripke models and intermediate logics (Q1271561) (← links)
- Decidable Kripke models of intuitionistic theories (Q1295382) (← links)
- A uniform tableau method for intuitionistic modal logics. I (Q1317899) (← links)
- On the predicate logics of finite Kripke frames (Q1344873) (← links)
- An improved refutation system for intuitionistic predicate logic (Q1344876) (← links)
- Completeness results for intuitionistic and modal logic in a categorical setting (Q1346248) (← links)
- On completeness theorems for feature logics (Q1353907) (← links)
- Model completions and r-Heyting categories (Q1372155) (← links)
- Propositional quantification in the topological semantics for \(\mathbf S4\) (Q1381441) (← links)
- Reverse mathematics and completeness theorems for intuitionistic logic (Q1422103) (← links)
- The revival of rejective negation (Q1582228) (← links)
- Eliminating disjunctions by disjunction elimination (Q1688959) (← links)
- A semantic hierarchy for intuitionistic logic (Q1740610) (← links)
- On the extension of intuitionistic propositional logic with Kreisel- Putnam's and Scott's schemes (Q1820767) (← links)
- Craig's interpolation theorem for the intuitionistic logic and its extensions - a semantical approach (Q1821770) (← links)
- Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity \(\leq \omega\) (Q1826435) (← links)
- Constructing a continuum of predicate extensions of each intermediate propositional logic (Q1891930) (← links)
- A method to single out maximal propositional logics with the disjunction property. I (Q1902974) (← links)
- A method to single out maximal propositional logics with the disjunction property. II (Q1902977) (← links)
- On Gabbay's proof of the Craig interpolation theorem for intuitionistic predicate logic (Q1906666) (← links)