Publication:5560258
From MaRDI portal
zbMath0172.28901MaRDI QIDQ5560258
Publication date: 1968
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
Related Items
Foundations of a theorem prover for functional and mathematical uses, A nucleus of a theorem-prover described inAlgol-68, SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation, How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q, Model existence theorems for modal and intuitionistic logics, Discovering boundary algebra: A simple notation for Boolean algebra and the truth functors, Unnamed Item, Increasing the efficiency of automated theorem proving, Uniform and non uniform strategies for tableaux calculi for modal logics, Property theory and the revision theory of definitions, Higher-order semantics and extensionality, An embedding of classical logic in S4, Eine Formulierung des Herbrandschen Satzes ohne Skolemfunktionen, Resolution in type theory, Infinitary formulas preserved under unions of models, Graded tableaux for Rational Pavelka Logic, Combining enumeration and deductive techniques in order to increase the class of constructible infinite models, A natural deduction system for first degree entailment, A real-time interval logic and its decision procedure, Interval logics and their decision procedures. I: An interval logic, Logical foundations for programming semantics, A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics, Theory matrices (for modal logics) using alphabetical monotonicity, Identity in modal logic theorem proving, The relative complexity of analytic tableaux and SL-resolution, Linearity and regularity with negation normal form, The logic of proofs, semantically, Tableau systems for paraconsistency and minimal inconsistency, TABLEAUX: A general theorem prover for modal logics, On a KTB-modal fuzzy logic, A guide to completeness and complexity for modal logics of knowledge and belief, A truncation technique for clausal analytic tableaux, Logic, sets, and mathematics, Representing scope in intuitionistic deductions, Proof methods for reasoning about possibility and necessity, Gentzen-type systems, resolution and tableaux, A tableau-like proof procedure for normal modal logics, On the relative merits of path dissolution and the method of analytic tableaux, Accelerating tableaux proofs using compact representations, Controlled integration of the cut rule into connection tableau calculi, The liberalized \(\delta\)-rule in free variable semantic tableaux, Tableau-based characterization and theorem proving for default logic, Uncertainty, predictability and decidability in chaotic dynamical systems, Algebraic proofs of cut elimination, A proper hierarchy of propositional sequent calculi, The relative complexity of resolution and cut-free Gentzen systems, The expected complexity of analytic tableaux analyses in propositional calculus. II, A theory of nonmonotonic rule systems. II, Tableau method for residuated logic, The complexity of concept languages, Revision programming, Four-valued logic, Probability and logic., A fuzzy logic with interval truth values, The proof complexity of analytic and clausal tableaux, On the intuitionistic force of classical search, Search algorithms in type theory, The revival of rejective negation, EXPtime tableaux for ALC, A procedural criterion for final derivability in inconsistency-adaptive logics, Using tableaux to automate the Lambek and other categorial calculi, Socratic proofs, Locally Boolean spectra, Default reasoning by deductive planning, Tableaus for many-valued modal logic, The logic of non-contingency, Ontologically minimal logical semantics, On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic, A logical framework for evolving software systems, On finite-valued propositional logical calculi, Many-valued logic and mixed integer programming, Knowledge-based proof planning, On the existence of a modal antinomy, Finite tree property for first-order logic with identity and functions, Formal verification of a generic framework to synthesize SAT-provers, Self-verifying axiom systems, the incompleteness theorem and related reflection principles, Interpolation for first order S5, Constructive interpolation in hybrid logic, Unnamed Item, Unnamed Item, A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief
