Results 1 to 10 of about 5,727 (317)
Finite sequent calculi for PLTL
Two sequent calculi for temporal logic of knowledge are presented: one containing invariant-like rule and the other containing looping axioms. Its proved that the calculi are equivalent, sound and complete.
Romas Alonderis +2 more
doaj +5 more sources
Sequent Calculi for Orthologic with Strict Implication
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 +4 more sources
Inducing syntactic cut-elimination for indexed nested sequents [PDF]
The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such calculi for the many
Revantha Ramanayake
doaj +3 more sources
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics [PDF]
We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents.
Rajeev Gore +2 more
doaj +3 more sources
Sequent Calculi for Choice Logics [PDF]
AbstractChoice logics constitute a family of propositional logics and are used for the representation of preferences, with especiallyqualitative choice logic(QCL) being an established formalism with numerous applications in artificial intelligence. While computational properties and applications of choice logics have been studied in the literature ...
Michael Bernreiter +3 more
openalex +3 more sources
Natural Deduction Calculi and Sequent Calculi for Counterfactual Logics [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francesca Poggiolesi
openalex +4 more sources
Dual-Context Calculi for Modal Logic [PDF]
We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of assumptions, one of which
G. A. Kavvos
doaj +6 more sources
Sequent Calculi for ‘Generally’
AbstractLogics of ‘generally’ (LG's) were introduced for handling assertions with some versions of vague notions (e.g. ‘generally’, ‘most’, ‘several’), which occur often in ordinary language and in science. LG's provide a framework for distinct notions of ‘generally’: one builds a specific logic for the notion one has in mind.
Leonardo Bruno Vana +2 more
openalex +2 more sources
Cut Elimination for Extended Sequent Calculi
We present a syntactical cut-elimination proof for an extended sequent calculus covering the classical modal logics in the \(\mathsf{K}\), \(\mathsf{D}\), \(\mathsf{T}\), \(\mathsf{K4}\), \(\mathsf{D4}\) and \(\mathsf{S4}\) spectrum.
Simone Martini +2 more
doaj +4 more sources
Nested Sequent Calculi for Normal Conditional Logics [PDF]
Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain analytic and modular proof systems for these logics.
Régis Alenda +2 more
openalex +5 more sources

