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
A propositional fragment of Leśniewski's ontology and its formulation by the tableau method, A tableau-like proof procedure for normal modal logics, Structured algebraic specifications: A kernel language, On the relative merits of path dissolution and the method of analytic tableaux, Quantified temporal alethic boulesic doxastic logic, Accelerating tableaux proofs using compact representations, Interpolation systems for ground proofs in automated deduction: a survey, Semantically-guided goal-sensitive reasoning: model representation, Completeness and decidability results for CTL in constructive type theory, Reasoning about coalitional games, On all strong Kleene generalizations of classical logic, 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, Partial models and logic programming, 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, Cut and pay, A compact representation of proofs, Tableau method for residuated logic, From reasonable preferences, via argumentation, to logic, The complexity of concept languages, Subalternation and existence presuppositions in an unconventionally formalized canonical square of opposition, Innovations in computational type theory using Nuprl, Synthesis of communicating process skeletons from temporal-spatial logic specifications, A sound framework for \(\delta\)-rule variants in free-variable semantic tableaux, The disconnection tableau calculus, Liberalized variable splitting, Tableau systems for paraconsistency and minimal inconsistency, Passive induction and a solution to a Paris-Wilkie open question, Socratic trees, Revision programming, Intuitionistic completeness of first-order logic, A near-optimal method for reasoning about action, A sieve for entailments, A proof system for the first-order relational calculus, Prefixed tableaus and nested sequents, Dual erotetic calculi and the minimal \(\mathsf{LFI}\), Application of modal logic to programming, Assertoric semantics and the computational power of self-referential truth, Tolerant, classical, strict, Incremental variable splitting, \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps, A continuum-valued logic of degrees of probability, Proof and refutation in MALL as a game, Analytic tableaux for higher-order logic with choice, A first order logic for partial functions, Four-valued logic, First-order dialogical games and tableaux, A curious dialogical logic and its composition problem, Finite additivity, another lottery paradox and conditionalisation, TABLEAUX: A general theorem prover for modal logics, Interval logics and their decision procedures. I: An interval logic, First-order logic and first-order functions, Hilbert's epsilon as an operator of indefinite committed choice, 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, 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, Tableau systems for deontic action logics based on finite Boolean algebras, and their complexity, Revising Carnap's semantic conception of modality, Logic, sets, and mathematics, The game of inquiry: The interrogative approach to inquiry and belief revision theory, Linearity and regularity with negation normal form, The logic of proofs, semantically, A framework for proof systems, A complete negationless system, PNL to HOL: from the logic of nominal sets to the logic of higher-order functions, Analytic resolution in theorem proving, The complexity of existential quantification in concept languages., Tavole semantiche per sistemi astratti di logica estensionale, 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, Tableaux and dual tableaux: transformation of proofs, The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4F, S4R, S4M and G., Supervaluationism and logical consequence: A third way, Relevant analytic tableaux, Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics, How true it is = who says it's true, Wittgensteinian tableaux, identity, and co-denotation, Representing scope in intuitionistic deductions, First order Stålmarck. Universal lemmas through branch merges, Cut elimination and word problems for varieties of lattices, The temporal logic of branching time, Proof methods for reasoning about possibility and necessity, Dialogues, strategies, and intuitionistic provability, Gentzen-type systems, resolution and tableaux, Proof theory for linear lattices, A tableau-based decision procedure for a fragment of set theory with iterated membership, Socratic proofs and paraconsistency: A case study, Two party immediate response disputes: Properties and efficiency, Admissibility of cut in LC with fixed point combinator, Inconsistency-adaptive dialogical logic, 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, Tableaus for many-valued modal logic, SEMANTIC POLLUTION AND SYNTACTIC PURITY, Extended First-Order Logic, The Best of All PossibleWorlds: Where Interrogative Games Meet Research Agendas, The logic of non-contingency, Ontologically minimal logical semantics, Can logic be combined with probability? Probably, 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, A general approach for determining the validity of commonsense assertions using conditional logics, A unification of two approaches to vagueness: the Boolean many-valued approach and the modal-precisificational approach, Craig interpolation with clausal first-order tableaux, Many-valued logic and mixed integer programming, A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs, Experimental results on the crossover point in random 3-SAT, Distributive-lattice semantics of sequent calculi with structural rules, Interpolation methods for Dunn logics and their extensions, Logical dialogues with explicit preference profiles and strategy selection, Rasiowa-Sikorski deduction systems with the rule of cut: a case study, An axiomatic account of question evocation: the propositional case, Languages of logic and their applications, Guest editor's introduction: JvH100, Editor's introduction to Jean van Heijenoort, ``Historical development of modern logic, Jean van Heijenoort's contributions to proof theory and its history, Herbrand's fundamental theorem in the eyes of Jean van Heijenoort, Temporal alethic-deontic logic and semantic tableaux, Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems, Reasoning processes in propositional logic, Probability and logic., The consistency argument for ranking functions, Towards a unified model of search in theorem-proving: subgoal-reduction strategies, Short Overview of the Development of Hintikka’s Work in Logic, Logic with numbers, Knowledge-based proof planning, A non-clausal tableau calculus for \textsc{MinSat}, On Search for Law-Like Statements as Abductive Hypotheses by Socratic Transformations, A Dynamic Logic of Interrogative Inquiry, Intuitive Semantics for First-Degree Entailment and ‘Coupled Trees’, Meeting of the Association for Symbolic Logic, Marseilles, 1981 (the Herbrand Symposium), Strategies of inquiry, the `Sherlock holmes sense of deduction' revisited, Self-verifying axiom systems, the incompleteness theorem and related reflection principles, Approximations of modal logics: \(\mathbf K\) and beyond, An analytic tableaux model for Deductive Mastermind empirically tested with a massively used online learning system, A survey of nonstandard sequent calculi, Decision procedures and expressiveness in the temporal logic of branching time, Bipartite bihypergraphs: a survey and new results, A loop-free decision procedure for modal propositional logics K4, S4 and S5, A procedural criterion for final derivability in inconsistency-adaptive logics, Socratic proofs for quantifiers, Bochenski on property identity and the refutation of universals, Intuitive semantics for first-degree entailments and `coupled trees', The decidability of the intensional fragment of classical linear logic, How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning, CUT AND GAMMA I: PROPOSITIONAL AND CONSTANT DOMAIN R, Normality, non-contamination and logical depth in classical natural deduction, Bounded-Resource Reasoning as (Strong or Classical) Planning, Key notions of Tarski's methodology of deductive systems, Craig's interpolation theorem for the intuitionistic logic and its extensions - a semantical approach, Hoare's logic for nondeterministic regular programs: A nonstandard approach, A fuzzy logic with interval truth values, Beyond graph neural networks with lifted relational neural networks, On the existence of a modal antinomy, The complexity of analytic tableaux, The proof complexity of analytic and clausal tableaux, On the intuitionistic force of classical search, Search algorithms in type theory, A definitive probabilistic semantics for first-order logic, The theory of functional and subset dependencies over relational expressions, Finite tree property for first-order logic with identity and functions, The revival of rejective negation, Intensional models for the theory of types, EXPtime tableaux for ALC, Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models, Formalizing a Seligman-style tableau system for hybrid logic (short paper), Using tableaux to automate the Lambek and other categorial calculi, Formal verification of a generic framework to synthesize SAT-provers, Synthetic tableaux: Minimal tableau search heuristics, From bi-facial truth to bi-facial proofs, On interpolation in automated theorem proving, Interpolation for first order S5
