Results 11 to 20 of about 191,191 (174)

Sequent systems for negative modalities [PDF]

open access: yesLogica Universalis, 2017
Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate semantics and
Lahav, Ori, Marcos, João, Zohar, Yoni
core   +3 more sources

Generalized DEL-Sequents [PDF]

open access: yes, 2012
Let us consider a sequence of formulas providing partial information about an initial situation, about a set of events occurring sequentially in this situation, and about the resulting situation after the occurrence of each event. From this whole sequence, we want to infer more information, either about the initial situation, or about one of the events,
Aucher, Guillaume   +2 more
openaire   +3 more sources

Cut free sequent calculus for logic S5n(ED)

open access: yesLietuvos 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

Synthesis of some biologically active 2,4'-bipyridine-5-carbonitriles carrying the 4-hydroxyphenylthio moiety [PDF]

open access: yesJournal 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

Restrictions for loop-check in sequent calculus for temporal logic with until operator

open access: yesLietuvos 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]

open access: yes, 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

The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs [PDF]

open access: yesElectronic 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

Restrictions for loop-check in sequent calculus for temporal logic

open access: yesLietuvos 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 Calculi and Relational Semantics for Temporal STIT Logics [PDF]

open access: yes, 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

A derivation-loop method for temporal logic

open access: yesLietuvos 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

Home - About - Disclaimer - Privacy