scientific article; zbMATH DE number 559756
From MaRDI portal
Publication:4289327
zbMath0798.03010MaRDI QIDQ4289327
Publication date: 2 May 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Mechanization of proofs and logical operations (03B35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Many-valued logic (03B50)
Related Items
1998 European Summer Meeting of the Association for Symbolic Logic, Analytic tableaux for non-deterministic semantics, A Modal-Layered Resolution Calculus for K, Automated theorem proving by resolution in non-classical logics, Equilibrium logic, Filter-based resolution principle for lattice-valued propositional logic LP\((X)\), Many-valued logic and mixed integer programming, MaxSAT resolution for regular propositional logic, Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach, Epimorphism between Fine and Ferguson’s Matrices for Angell’s AC, Bisequent calculus for four-valued quasi-relevant logics: cut elimination and interpolation, Latticed Simulation Relations and Games, Tableaux for logic programming with strong negation, MUltlog 1.0: Towards an expert system for many-valued logics, The tableau-based theorem prover 3 T A P Version 4.0, Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices, Hypersequent and display calculi -- a unified perspective, Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\), On partial and paraconsistent logics, \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\), MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions, Effective Finite-Valued Approximations of General Propositional Logics, A mechanization of strong Kleene logic for partial functions, On Theorem Proving in Annotated Logics, Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis, CWA Extensions to Multi-Valued Logics, Temporal reasoning over linear discrete time, Giles's game and the proof theory of Łukasiewicz logic, The number of clones determined by disjunctions of unary relations, Unranked fuzzy logic and reasoning, Quantified Equilibrium Logic and Foundations for Answer Set Programs, Optimal axiomatizations of finitely valued logics, An Algebraic Method to Decide the Deduction Problem in Many-Valued Logics, Complexity issues in Basic Logic
Uses Software
