scientific article; zbMATH DE number 3274715
From MaRDI portal
Publication:5560258
zbMath0172.28901MaRDI QIDQ5560258
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols ⋮ How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q ⋮ The polynomial hierarchy and a simple model for competitive analysis ⋮ Tableau for the logic ILP ⋮ Discovering boundary algebra: A simple notation for Boolean algebra and the truth functors ⋮ Foundations of a theorem prover for functional and mathematical uses ⋮ Linear reasoning in modal logic ⋮ THE LOGIC OF SEQUENCE FRAMES ⋮ Higher-order semantics and extensionality ⋮ Increasing the efficiency of automated theorem proving ⋮ Uniform and non uniform strategies for tableaux calculi for modal logics ⋮ An embedding of classical logic in S4 ⋮ A Beginner's Guide to Mathematical Logic ⋮ Eine Formulierung des Herbrandschen Satzes ohne Skolemfunktionen ⋮ Inquirers: A general model of non-ideal rational agents ⋮ Type theory as a foundation for computer science ⋮ Resolution in type theory ⋮ Logic without metaphysics ⋮ Systematization of finite many-valued logics through the method of tableaux ⋮ Representing formulas of propositional logic by cographs, permutations and tables ⋮ Complementary proof nets for classical logic ⋮ SODES: solving ordinary differential equations step by step ⋮ DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC ⋮ A Tableaux System for Deontic Action Logic ⋮ Tableaux for logic programming with strong negation ⋮ Non-elementary speed-ups in proof length by different variants of classical analytic calculi ⋮ Ordered tableaux: Extensions and applications ⋮ Projection: A unification procedure for tableaux in Conceptual Graphs ⋮ On quasitautologies ⋮ Unnamed Item ⋮ Rejection in Łukasiewicz’s and Słupecki’s Sense ⋮ Infinitary formulas preserved under unions of models ⋮ Unnamed Item ⋮ A logic for best explanations ⋮ GENERALITY AND EXISTENCE 1: QUANTIFICATION AND FREE LOGIC ⋮ TRACTARIAN FIRST-ORDER LOGIC: IDENTITY AND THE N-OPERATOR ⋮ Proof-terms for classical and intuitionistic resolution ⋮ Incremental theory reasoning methods for semantic tableaux ⋮ A simple tableau system for the logic of elsewhere ⋮ A tableau calculus for minimal model reasoning ⋮ On the intuitionistic force of classical search (Extended abstract) ⋮ Doxastic logic: a new approach ⋮ Graded tableaux for Rational Pavelka Logic ⋮ New Arguments for Adaptive Logics as Unifying Frame for the Defeasible Handling of Inconsistency ⋮ Method of Analysis: A Paradigm of Mathematical Reasoning? ⋮ Combining enumeration and deductive techniques in order to increase the class of constructible infinite models ⋮ Towards an Efficient Prover for the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>C</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math> Paraconsistent Logic ⋮ The Universe of Approximations ⋮ A Tableau Method for the Lambek Calculus based on a Matrix Characterization ⋮ A natural deduction system for first degree entailment ⋮ A nucleus of a theorem-prover described inAlgol-68 ⋮ Using Abduction to Compute Efficient Proofs ⋮ Analytic Tableaux for Higher-Order Logic with Choice ⋮ Temporal Alethic Dyadic Deontic Logic and the Contrary-to-Duty Obligation Paradox ⋮ Simulation of Natural Deduction and Gentzen Sequent Calculus ⋮ An Analytic Logic of Aggregation ⋮ A real-time interval logic and its decision procedure ⋮ Automata and Answer Set Programming ⋮ Fragments of first order logic, I: universal Horn logic ⋮ Refinements of Vaught's normal from theorem ⋮ Property theory and the revision theory of definitions ⋮ Unnamed Item ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem ⋮ Property-Based Testing for Spark Streaming ⋮ Aristotelian Logic Axioms in Propositional Logic: The Pouch Method ⋮ Stoic Sequent Logic and Proof Theory ⋮ SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A first order logic for partial functions ⋮ Tableaux for logics of time and knowledge with interactions relating to synchrony ⋮ An efficient relational deductive system for propositional non-classical logics ⋮ An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency ⋮ On the proof theory of the modal logic for arithmetic provability ⋮ What you always wanted to know about rigid E-unification ⋮ A theory of data dependencies over relational expressions ⋮ A lower bound for the complexity of Craig's interpolants in sentential logic ⋮ A Defeasible Calculus for Zetetic Agents ⋮ INFINITARY TABLEAU FOR SEMANTIC TRUTH ⋮ A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief ⋮ Model existence theorems for modal and intuitionistic logics ⋮ Did Descartes make a diagonal argument? ⋮ Socratic proofs ⋮ Completeness and decidability of general first-order logic (with a detour through the guarded fragment) ⋮ Constructive interpolation in hybrid logic ⋮ Free-variable semantic tableaux for the logic of fuzzy inequalities ⋮ A graphical representation of relational formulae with complementation ⋮ Decision Procedures for Region Logic ⋮ The universe of propositional approximations ⋮ Automated Reasoning Building Blocks ⋮ Locally Boolean spectra ⋮ Analytic tableaux for non-deterministic semantics ⋮ Eliminating models during model elimination ⋮ Henkin’s Theorem in Textbooks ⋮ Henkin’s Completeness Proof and Glivenko’s Theorem ⋮ A Propositional Tableaux Based Proof Calculus for Reasoning with Default Rules ⋮ Two decision procedures for da Costa's \(C_n\) Logics based on restricted Nmatrix semantics ⋮ Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \) ⋮ A note on cut-elimination for classical propositional logic ⋮ Default reasoning by deductive planning
This page was built for publication:
