Results 21 to 30 of about 136,655 (280)

Superdeduction in Lambda-Bar-Mu-Mu-Tilde [PDF]

Electronic Proceedings in Theoretical Computer Science, 2011
Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way.
Clément Houtmann
doaj   +1 more source

Revising a Labelled Sequent Calculus for Public Announcement Logic [PDF]

, 2015
We first show that a labelled sequent calculus G3PAL for Public AnnouncementLogic (PAL) by Maffezioli and Negri (2011) has been lacking rulesfor deriving an axiom of Hilbert-style axiomatization of PAL.
Katsuhiko Sano, Nomura, Shoshin, Shoshin Nomura, Tojo, Satoshi, Sano, Katsuhiko, Satoshi Tojo   +5 more
core   +1 more source

Two loop detection mechanisms: a comparison [PDF]

, 1997
In order to compare two loop detection mechanisms we describe two calculi for theorem proving in intuitionistic propositional logic. We call them both MJ Hist, and distinguish between them by description as `Swiss' or `Scottish'. These calculi combine in
Howe, J. M., Howe, Jacob M., Jacob Howe, Jacob M. Howe   +3 more
core   +1 more source

Multi-succedent sequent calculus for intuitionistic epistemic logic

Lietuvos Matematikos Rinkinys
A 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

Tools and techniques for formalising structural proof theory [PDF]

, 2010
Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent calculus which is the most amenable of the formalisms to metamathematical treatment.
Chapman, Peter
core   +2 more sources

Sequent Calculus Viewed Modulo [PDF]

, 2000
Colloque avec actes et comité de lecture. internationale.International audienceThe first-order sequent calculus is generally considered as containing no computation but only pure deduction.
Deplagne, Eric
core   +4 more sources

Uniform Proofs of Normalisation and Approximation for Intersection Types [PDF]

Electronic Proceedings in Theoretical Computer Science, 2015
We present intersection type systems in the style of sequent calculus, modifying the systems that Valentini introduced to prove normalisation properties without using the reducibility method.
Kentaro Kikuchi
doaj   +1 more source

Sequent calculus for propositional likelihood logic

Lietuvos Matematikos Rinkinys, 2023
There is not abstract.
Romas Alonderis
doaj   +3 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

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