Pages that link to "Item:Q1056744"
From MaRDI portal
The following pages link to Proof methods for modal and intuitionistic logics (Q1056744):
Displaying 50 items.
- Labeled sequent calculi for modal logics and implicit contractions (Q377468) (← links)
- Self-referentiality of Brouwer-Heyting-Kolmogorov semantics (Q392298) (← links)
- Loop-free calculus for modal logic S4. I (Q392988) (← links)
- Tableaux and hypersequents for justification logics (Q408538) (← links)
- Prefixed tableaus and nested sequents (Q409323) (← links)
- A tableau-based decision procedure for CTL\(^*\) (Q432138) (← links)
- On graph calculi for multi-modal logics (Q530865) (← links)
- First-order intensional logic (Q598308) (← links)
- Possible worlds in use (Q647416) (← links)
- Proof analysis in intermediate logics (Q661286) (← links)
- 3-SAT = SAT for a class of normal modal logics (Q673009) (← links)
- A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics (Q687153) (← links)
- Theory matrices (for modal logics) using alphabetical monotonicity (Q687154) (← links)
- An intriguing logic with two implicational connectives (Q698537) (← links)
- Constructive modal logics. I (Q750417) (← links)
- ExpTime tableau decision procedures for regular grammar logics with converse (Q763333) (← links)
- Uniform Lyndon interpolation property in propositional modal logics (Q781510) (← links)
- Proof analysis in modal logic (Q812101) (← links)
- Belief, information acquisition, and trust in multi-agent systems -- a modal logic formulation (Q814504) (← links)
- Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere (Q817688) (← links)
- Finite and physical modalities (Q817962) (← links)
- Connectionist modal logic: representing modalities in neural networks (Q870254) (← links)
- An epistemic model of logic programming (Q918192) (← links)
- Automata can show PSpace results for description logics (Q948069) (← links)
- Display calculi and other modal calculi: a comparison (Q987468) (← links)
- The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4F, S4R, S4M and G. (Q1005938) (← links)
- Reference and perspective in intuitionistic logics (Q1006455) (← links)
- Metatheory of actions: beyond consistency (Q1028966) (← links)
- Cut elimination for \(\mathrm{S4}_n\) and \(\mathrm{K4}_n\) with the central agent axiom (Q1042695) (← links)
- Automated inferencing (Q1070835) (← links)
- Synthesis of communicating process skeletons from temporal-spatial logic specifications (Q1116944) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- Local model checking for infinite state spaces (Q1190489) (← links)
- Representing scope in intuitionistic deductions (Q1274448) (← links)
- A simple propositional \(\text{S}5\) tableau system (Q1295438) (← links)
- Proof methods for reasoning about possibility and necessity (Q1310399) (← links)
- A uniform tableau method for intuitionistic modal logics. I (Q1317899) (← links)
- A tableau-like proof procedure for normal modal logics (Q1329745) (← links)
- Accelerating tableaux proofs using compact representations (Q1334905) (← links)
- Cut-free sequent and tableau systems for propositional Diodorean modal logics (Q1337606) (← links)
- A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics (Q1344886) (← links)
- Completeness of a first-order temporal logic with time-gaps (Q1350524) (← links)
- Tableau method for residuated logic (Q1357163) (← links)
- Propositional lax logic (Q1368378) (← links)
- Indexed systems of sequents and cut-elimination (Q1372944) (← links)
- Definability and commonsense reasoning (Q1402721) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- Prehistoric graph in modal derivations and self-referentiality (Q1678748) (← links)
- Sequent systems for negative modalities (Q1682296) (← links)
- ``That will do'': logics of deontic necessity and sufficiency (Q1706805) (← links)
