Results 11 to 20 of about 165,353 (118)
Sequent Calculi for Orthologic with Strict Implication
Bulletin of the Section of Logic, 2022 In this study, new sequent calculi for a minimal quantum logic (\(\bf MQL\)) are discussed that involve an implication. The sequent calculus \(\bf GO\) for \(\bf MQL\) was established by Nishimura, and it is complete with respect to ortho-models (O ...
Tomoaki Kawano
doaj +1 more source
Synthesis of some biologically active 2,4'-bipyridine-5-carbonitriles carrying the 4-hydroxyphenylthio moiety [PDF]
Journal of the Serbian Chemical Society, 2009 A series of new 4-aryl-2'-[(4-hydroxyphenyl)thio]-6oxo-1,6-dihydro- 2,4'-bipyridine-5-carbonitriles (3a-k) and 6-amino-4aryl-2'-[(4-hydroxyphenyl) thio]-2,4'-bipyridine-5-carbonitriles (4a-h) were synthesized from 4-hydroxythiophenol (1). The reaction of
Karabasanagouda T. +2 more
doaj +1 more source
The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic.
Arno Ehle +2 more
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
Restrictions for loop-check in sequent calculus for temporal logic with until operator
Lietuvos Matematikos Rinkinys, 2009 In this paper, we present sequent calculus for branching-time temporal logic with until operator. This sequent calculus uses efficient loop-checktechinque.
Adomas Birštunas
doaj +1 more source
Canonical Proof nets for Classical Logic [PDF]
, 2012 Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof.
McKinley, Richard
core +2 more sources
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
Efficient loop-check for multimodal KD45n logic
Lietuvos Matematikos Rinkinys, 2021 We introduce sequent calculus for multi-modal logic KD45n which uses efficient loop-check. Efficiency of the used loop-check is obtained by using marked modal operator squarei which is used as an alternative to sequent with histories ([2,3]).We use ...
Adomas Birštunas
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
Cut-free Calculi and Relational Semantics for Temporal STIT Logics [PDF]
, 2019 We present cut-free labelled sequent calculi for a central formalism in logics of agency: STIT logics with temporal operators. These include sequent systems for Ldm , Tstit and Xstit. All calculi presented possess essential structural properties such as
AN Prior +19 more
core +4 more sources