Results 31 to 40 of about 580,256 (322)
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
The Epsilon Calculus and Herbrand Complexity [PDF]
, 2005 Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator $\epsilon_{x}$. Two fundamental results about the epsilon-calculus, the first and second epsilon theorem, play a role similar to that which ...
A. Blass +20 more
core +2 more sources
Partial cut elimination for propositional discrete linear time temporal logic
Lietuvos Matematikos Rinkinys, 2010 We consider propositional discrete linear time temporal logic with future and past operators of time. For each formula ϕ of this logic, we present Gentzen-type sequent calculus Gr(ϕ) with a restricted cut rule.
Jūratė Sakalauskaitė
doaj +1 more source
Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts
Bulletin of the Section of Logic, 2022 This paper is about non-labelled proof-systems for hybrid logic, that is, proofsystems where arbitrary formulas can occur, not just satisfaction statements.
Torben Braüner
doaj +1 more source
Canonical calculi with (n,k)-ary quantifiers [PDF]
Logical Methods in Computer Science, 2008 Propositional canonical Gentzen-type systems, introduced in 2001 by Avron and Lev, are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a connective is introduced and no ...
Arnon Avron, Anna Zamansky
doaj +1 more source
On Multiplicative Linear Logic, Modality and Quantum Circuits [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 A logical system derived from linear logic and called QMLL is introduced and shown able to capture all unitary quantum circuits. Conversely, any proof is shown to compute, through a concrete GoI interpretation, some quantum circuits.
Ugo Dal Lago, Claudia Faggian
doaj +1 more source
Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs
, 2017 We present a sequent calculus for the modal Grzegorczyk logic Grz allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.Comment: WOLLIC'17, 12 pages, 1 ...
A Avron +5 more
core +1 more source
A simple proof that super consistency implies cut elimination [PDF]
, 2011 International audienceWe give a simple and direct proof that super-consistency implies the cut elimination property in deduction modulo. This proof can be seen as a simpli cation of the proof that super-consistency implies proof normalization.
Dowek, Gilles, Hermant, Olivier
core +6 more sources
Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 2000 Presents new proofs of cut elimination for intuitionistic, classical and linear sequent calculi. In all cases, the proofs proceed by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations.
openaire +1 more source
An Investigation into the Multi-Pass Radial-Mode Micro Abrasive Air Jet Turning of Fused-Silica Rods
Machines, 2023 With the increased requirement of miniaturization structures on hard and brittle substrates, micro abrasive air jet turning technology has become a promising machining technology for manufacturing miniaturization structures.
Ruibo Yang +4 more
doaj +1 more source