Imperatives: a Judgemental AnalysisStudia Logica - Tập 100 - Trang 879-905 - 2012
Chris Fox
This paper proposes a framework for formalising intuitions about the behaviour of imperative commands. It seeks to capture notions of satisfaction and coherence. Rules are proposed to express key aspects of the general logical behaviour of imperative constructions. A key objective is for the framework to allow patterns of behaviour to be described while avoiding making any commitments about how co...... hiện toàn bộ
Coherence and Computational Complexity of Quantifier-free Dependence Logic FormulasStudia Logica - Tập 101 - Trang 267-291 - 2013
Jarmo Kontinen
We study the computational complexity of the model checking problem for quantifier-free dependence logic
$${(\mathcal{D})}$$
formulas. We characterize three thresholds in the complexity: logarithmic space (LOGSPACE), non-deterministic logarithmic space (NL) and non-deterministic polynomial time (NP).
Tableaus for many-valued modal logicStudia Logica - Tập 55 - Trang 63-87 - 1995
Melvin Fitting
We continue a series of papers on a family of many-valued modal logics, a family whose Kripke semantics involves many-valued accessibility relations. Earlier papers in the series presented a motivation in terms of a multiple-expert semantics. They also proved completeness of sequent calculus formulations for the logics, formulations using a cut rule in an essential way. In this paper a novel cut-f...... hiện toàn bộ
An extension of the Łukasiewicz logic to the modal logic of quantum mechanicsStudia Logica - Tập 37 - Trang 149-155 - 1978
Herman Dishkant
An attempt is made to include the axioms of Mackey for probabilities of experiments in quantum mechanics into the calculusŁ
x0
of Łukasiewicz. The obtained calculusŁQ contains an additional modal signQ and four modal rules of inference. The propositionQx is read “x is confirmed”. The most specific rule of inference may be read: for comparable observations implic...... hiện toàn bộ
Postponement of $$\mathsf {raa}$$ and Glivenko’s Theorem, RevisitedStudia Logica - Tập 107 Số 1 - Trang 109-144 - 2019
Guerrieri, Giulio, Naibo, Alberto
We study how to postpone the application of the reductio ad absurdum rule ( $$\mathsf {raa}$$ ) in classical natural deduction. This technique is connected with two normalization strategies for classical logic, due to Prawitz and Seldin, respectively. We introduce a variant of Seldin’s strategy for the postponement of $$\mathsf {raa}$$ , which induces a negative translation (a variant of Kuroda’s ...... hiện toàn bộ