Results 11 to 20 of about 25,817 (283)
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
core +5 more sources
Sequent Calculi for Intuitionistic Gödel–Löb Logic [PDF]
The paper investigates two sequent calculi for the modal logic iGL, which is the intuitionistic version of the Gödel-Löb logic (the classical provability logic). The first one, GL3i, is a common cut-free one-sided sequent calculus for intuitionistic logic augmented with the GL modal rule \[ \frac{\Box\Gamma,\Gamma,\Box A\Rightarrow A}{\Pi,\Box\Gamma ...
Iris van der Giessen, Rosalie Iemhoff
core +5 more sources
Sequent Calculi for Beginners and Professionals [PDF]
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 +3 more sources
Unified Sequent Calculi and Natural Deduction Systems for Until-free Linear-time Temporal Logics
A 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
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
Tableaux and Sequent Calculi for CTL and ECTL: Satisfiability Test with Certifying Proofs and Models [PDF]
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
Sequent Calculi for the Propositional Logic of HYPE [PDF]
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 +4 more sources
On the relationship between hypersequent calculi and labelled sequent calculi for intermediate logics with geometric Kripke semantics [PDF]
In this thesis we examine the relationship between hypersequent and some types of labelled sequent calculi for a subset of intermediate logics—logics between intuitionistic (Int), and classical logics—that have geometric Kripke semantics, which we call ...
Rothenberg, Robert
core +2 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 B. Vana +2 more
openaire +1 more source
Two loop detection mechanisms: a comparison [PDF]
In order to compare two loop detection mechanisms we describe two calculi for theorem proving in intuitionistic propositional logic. We call them both MJ Hist, and distinguish between them by description as `Swiss' or `Scottish'. These calculi combine in
Howe, J. M. +3 more
core +1 more source

