Results 31 to 40 of about 170,706 (312)
Restrictions for loop-check in sequent calculus for temporal logic
Lietuvos Matematikos Rinkinys, 2008 In this paper, we present sequent calculus for linear temporal logic. This sequent calculus uses efficient loop-check techinque. We prove that we can use not all but only several special sequents from the derivation tree for the loop-check.
Adomas Birštunas
doaj +1 more source
Cut free sequent calculus for logic S5n(ED)
Lietuvos Matematikos Rinkinys, 2010 Hilbert style, Gentzen style sequent and Kanger style sequent calculi for logic S5n(ED) are considered in this paper. Gentzen style sequent calculus is constructed and its equivalence with Hilbert style system is proved, getting soundness and ...
Haroldas Giedra
doaj +1 more source
A Cut-Free Sequent Calculus for Defeasible Erotetic Inferences [PDF]
Studia Logica: An International Journal for Symbolic Logic, 2018 In recent years, the effort to formalize erotetic inferences—i.e., inferences to and from questions—has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences.
Jared Millson
semanticscholar +1 more source
Completing herbelin's programme [PDF]
, 2007 In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the $\lambda$-calculus, specifically a variant which ...
Espírito Santo, José
core +1 more source
Multi-succedent sequent calculus for intuitionistic epistemic logic
Lietuvos Matematikos RinkinysA multi-succedent sequent calculus for intuitionistic epistemic logic (IEL) is introduced in the paper. It is proved that the structural rules of weakening and contraction and the rule of cut are admissible in the calculus.
Romas Alonderis
doaj +3 more sources
Proof Theory of Finite-valued Logics [PDF]
, 1993 The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux
Zach, Richard
core +5 more sources
Brodsky’s coding method for propositional logic
Lietuvos Matematikos Rinkinys, 2017 Brodsky’s coding method for propositional logic is considered in the paper. Based on the sequent calculus, the method allows us to determine whether an arbitrary sequent is derivable in the calculus without constructing proof-search trees.
Romas Alonderis
doaj +1 more source
Structural Interactions and Absorption of Structural Rules in BI Sequent Calculus [PDF]
, 2016 Development of a contraction-free BI sequent calculus, be the contraction-freeness implicit or explicit, has not been successful in the literature. We address this problem by presenting such a sequent system. Our calculus involves no structural rules. It
Arisaka, Ryuta
core +3 more sources
A Sequent Calculus for Opetopes
Logic in Computer Science, 2019 Opetopes are algebraic descriptions of shapes corresponding to compositions in higher dimensions. As such, they offer an approach to higher-dimensional algebraic structures, and in particular, to the definition of weak $\omega$ -categories, which was the
Cédric Ho Thanh, P. Curien, S. Mimram
semanticscholar +1 more source
Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus
Lietuvos Matematikos Rinkinys, 2008 In the paper, we define some classes of sequents of the propositional intuitionistic logic. These are classes of primarily and α-primarily reducible sequents. Then we show how derivability of these sequents in a propositional intuitionistic logic sequent
Romas Alonderis
doaj +1 more source