The following pages link to (Q5560258):
Displaying 50 items.
- Hilbert's epsilon as an operator of indefinite committed choice (Q946570) (← links)
- The game of inquiry: The interrogative approach to inquiry and belief revision theory (Q970088) (← links)
- The complexity of existential quantification in concept languages. (Q989170) (← links)
- Tableaux and dual tableaux: transformation of proofs (Q995673) (← links)
- The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4F, S4R, S4M and G. (Q1005938) (← links)
- Supervaluationism and logical consequence: A third way (Q1005963) (← links)
- How true it is = who says it's true (Q1015490) (← links)
- Wittgensteinian tableaux, identity, and co-denotation (Q1020577) (← links)
- First order Stålmarck. Universal lemmas through branch merges (Q1040785) (← links)
- Dialogues, strategies, and intuitionistic provability (Q1061740) (← links)
- Proof theory for linear lattices (Q1070254) (← links)
- A propositional fragment of Leśniewski's ontology and its formulation by the tableau method (Q1078555) (← links)
- Structured algebraic specifications: A kernel language (Q1080652) (← links)
- Partial models and logic programming (Q1094151) (← links)
- A compact representation of proofs (Q1102282) (← links)
- Synthesis of communicating process skeletons from temporal-spatial logic specifications (Q1116944) (← links)
- Tableau systems for paraconsistency and minimal inconsistency (Q1127720) (← links)
- A near-optimal method for reasoning about action (Q1134756) (← links)
- A sieve for entailments (Q1137032) (← links)
- A proof system for the first-order relational calculus (Q1138391) (← links)
- Application of modal logic to programming (Q1150592) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- On a KTB-modal fuzzy logic (Q1189907) (← links)
- A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476) (← links)
- A truncation technique for clausal analytic tableaux (Q1198076) (← links)
- Logic, sets, and mathematics (Q1209798) (← links)
- A complete negationless system (Q1221742) (← links)
- Analytic resolution in theorem proving (Q1233325) (← links)
- Tavole semantiche per sistemi astratti di logica estensionale (Q1237721) (← links)
- Consistency property and model existence theorem for second order negative languages with conjunctions and quantifications over sets of cardinality smaller than a strong limit cardinal of denumerable cofinality (Q1241504) (← links)
- Relevant analytic tableaux (Q1257473) (← links)
- Representing scope in intuitionistic deductions (Q1274448) (← links)
- Proof methods for reasoning about possibility and necessity (Q1310399) (← links)
- Gentzen-type systems, resolution and tableaux (Q1311413) (← links)
- A tableau-like proof procedure for normal modal logics (Q1329745) (← links)
- On the relative merits of path dissolution and the method of analytic tableaux (Q1331929) (← links)
- Accelerating tableaux proofs using compact representations (Q1334905) (← links)
- Controlled integration of the cut rule into connection tableau calculi (Q1344875) (← links)
- The liberalized \(\delta\)-rule in free variable semantic tableaux (Q1344882) (← links)
- Tableau-based characterization and theorem proving for default logic (Q1344885) (← links)
- Uncertainty, predictability and decidability in chaotic dynamical systems (Q1346395) (← links)
- Algebraic proofs of cut elimination (Q1349247) (← links)
- A proper hierarchy of propositional sequent calculi (Q1350509) (← links)
- The relative complexity of resolution and cut-free Gentzen systems (Q1353988) (← links)
- The expected complexity of analytic tableaux analyses in propositional calculus. II (Q1353995) (← links)
- A theory of nonmonotonic rule systems. II (Q1354038) (← links)
- Tableau method for residuated logic (Q1357163) (← links)
- The complexity of concept languages (Q1363785) (← links)
- Revision programming (Q1389448) (← links)
- Four-valued logic (Q1422105) (← links)
