Results 21 to 30 of about 14,982 (276)
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
Polarizing Double Negation Translations [PDF]
, 2013 Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations.
A. Kolmogorov +14 more
core +4 more sources
A Sequent Calculus for Opetopes [PDF]
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 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 ω-categories, which was the original motivation for their introduction by Baez and Dolan.
Ho Thanh, Cédric +2 more
openaire +2 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
A Systematic Approach to Canonicity in the Classical Sequent Calculus [PDF]
, 2012 International audienceThe sequent calculus is often criticized for requiring proofs to contain large amounts of low-level syntactic details that can obscure the essence of a given proof.
Chaudhuri, Kaustuv +2 more
core +9 more sources
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
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus [PDF]
, 2013 International audienceWe describe how the Davis-Putnam-Logemann-Loveland proced- ure DPLL is bisimilar to the goal-directed proof-search mechanism described by a standard but carefully chosen sequent calculus.
Farooque, Mahfuza +2 more
core +3 more sources
Sequent calculus usage for BDI agent implementation
Lietuvos Matematikos Rinkinys, 2023 BDI logic is widely used to describe agent based systems, since it can express a lot of different real world domains with three main operators: belief, desire and intention.
Adomas Birstunas
doaj +3 more sources
A derivation-loop method for temporal logic
Lietuvos Matematikos Rinkinys, 2019 Various types of calculi (Hilbert, Gentzen sequent, resolution calculi, tableaux) for propositional linear temporal logic (PLTL) have been considered in the literature.
Romas Alonderis, Haroldas Giedra
doaj +1 more source