Results 31 to 40 of about 5,727 (317)
On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems [PDF]
, 2020 This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined ...
A Ciabattoni +17 more
core +2 more sources
Dual Systems of Sequents and Tableaux for Many-Valued Logics [PDF]
, 1993 The aim of this paper is to emphasize the fact that for all finitely-many-valued logics there is a completely systematic relation between sequent calculi and tableau systems.
Baaz, Matthias +2 more
core +3 more sources
Simple Decision Procedure for S5 in Standard Cut-Free Sequent Calculus [PDF]
, 2016 In the paper a decision procedure for S5 is presented which uses a cut-free sequent calculus with additional rules allowing a reduction to normal modal forms. It utilizes the fact that in S5 every formula is equivalent to some 1-degree formula, i.e.
Indrzejczak, Andrzej
core +1 more source
Mathematical Text Processing in EA-style: a Sequent Aspect
Journal of Formalized Reasoning, 2016 The paper is devoted to the study of one of the aspects of the so-called Evidence Algorithm programme advanced by Academician V.M.~Glushkov and connected with the problem of automated theorem-proving search in the signature of first-order theories that ...
Alexander Lyaletski
doaj +1 more source
An Intuitionistic Formula Hierarchy Based on High-School Identities [PDF]
, 2018 We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal) propositional sequent ...
Hardy G. H. +3 more
core +4 more sources
A Survey of Nonstandard Sequent Calculi [PDF]
Studia Logica, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Admissibility, compatibility, and deducibility in first-order sequent logics [PDF]
Computer Science Journal of Moldova, 2015 The paper is about the notions of admissibility and compatibility and their significance for deducibility in different sequent logics including first-order classical and intuitionistic ones both without and with equality and, possibly, with modal rules.
Alexander Lyaletski
doaj
Sequent calculus for logic of correlated knowledge
Lietuvos Matematikos Rinkinys, 2011 Sound and complete sequent calculi for general epistemic logic and logic of correlated knowledge are presented in this paper.
Haroldas Giedra +1 more
doaj +1 more source
On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas.
Federico Aschieri
doaj +1 more source
Proof Complexity of Propositional Default Logic [PDF]
, 2010 Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic.
Beyersdorff, O +4 more
core +3 more sources