Results 11 to 20 of about 1,740 (284)
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics [PDF]
Logical Methods in Computer Science, 2011 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
Unified Sequent Calculi and Natural Deduction Systems for Until-free Linear-time Temporal Logics [PDF]
Bulletin of the Section of LogicA unified Gentzen-style proof-theoretic framework for until-free propositional linear-time temporal logic and its intuitionistic variant is introduced.
Norihiro Kamide, Sara Negri
doaj +2 more sources
Sequent Calculi with procedure calls [PDF]
CoRR, 2013 In this paper, we introduce two focussed sequent calculi, LKp(T) and LK+(T), that are based on Miller-Liang's LKF system for polarised classical logic. The novelty is that those sequent calculi integrate the possibility to call a decision procedure for some background theory T, and the possibility to polarise literals "on the fly" during proof-search ...
Mahfuza Farooque +1 more
core +8 more sources
Sequent Calculi for Beginners and Professionals [PDF]
Logic and Logical Philosophy, 2018 Book Reviews: Andrzej Indrzejczak, Rachunki sekwentowe w logice klasycznej (Sequent calculi for classical logic), Wydawnictwo Uniwersytetu Łódzkiego, Łódź, 2013, 299 pages, ISBN 978-83-7525-812 ...
Mateusz Klonowski, Klonowski, Mateusz
openaire +4 more sources
Multi-type Sequent Calculi [PDF]
, 2014 Display calculi are generalized sequent calculi which enjoy a `canonical' cut elimination strategy. That is, their cut elimination is uniformly obtained by verifying the assumptions of a meta-theorem, and is preserved by adding or removing structural rules.
Frittella, Sabine +4 more
openaire +4 more sources
Modular Sequent Calculi for Classical Modal Logics [PDF]
Studia Logica, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David R. Gilbert, Paolo Maffezioli
openaire +5 more sources
Tableaux and Sequent Calculi for CTL and ECTL: Satisfiability Test with Certifying Proofs and Models [PDF]
, 2023 Certifying proofs are automated deductive proofs obtained as outcomes of a formal verification of temporal properties, where model checking is one of the most prominent approaches. The satisfiability problem for the Computation Tree Logic (CTL) cannot be
Abuin, A. +3 more
core +1 more source
Inducing syntactic cut-elimination for indexed nested sequents [PDF]
Logical Methods in Computer Science, 2018 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 +1 more source
Sequent Calculi for the classical fragment of Bochvar and Halldén's Nonsense Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In this paper sequent calculi for the classical fragment (that is, the conjunction-disjunction-implication-negation fragment) of the nonsense logics B3, introduced by Bochvar, and H3, introduced by Halldén, are presented.
Marcelo E. Coniglio, María I. Corbalán
doaj +1 more source
Sequent Calculi for the Propositional Logic of HYPE [PDF]
Studia Logica, 2021 AbstractIn this paper we discuss sequent calculi for the propositional fragment of the logic of HYPE. The logic of HYPE was recently suggested by Leitgeb (Journal of Philosophical Logic 48:305–405, 2019) as a logic for hyperintensional contexts. On the one hand we introduce a simple $$\mathbf{G1}$$ G
openaire +3 more sources