English
Related papers

Related papers: Temporal interpretation of intuitionistic quantifi…

200 papers

Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…

Logic · Mathematics 2021-09-07 Nicholas Pischke

Temporal logics over finite traces are not the same as temporal logics over potentially infinite traces. Ro\c{s}u first proved completeness for linear temporal logic on finite traces (LTLf) with a novel coinductive axiom. We offer a…

Logic in Computer Science · Computer Science 2021-07-14 Eric Campbell , Michael Greenberg

The provability logic of a theory $T$ captures the structural behavior of formalized provability in $T$ as provable in $T$ itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability…

Logic · Mathematics 2015-04-01 Evan Goris , Joost J. Joosten

This article presents a novel interpretation of quantum mechanics. It extends the meaning of ``measurement'' to include all property-indicating facts. Intrinsically space is undifferentiated: there are no points on which a world of locally…

Quantum Physics · Physics 2009-10-31 Ulrich Mohrhoff

Several recent results bring into focus the superintuitionistic nature of most notions of proof-theoretic validity, but little work has been done evaluating the consequences of these results. Proof-theoretic validity claims to offer a…

Logic · Mathematics 2023-05-17 Will Stafford

Every countable language which conforms to classical logic is shown to have an extension which conforms to classical logic, and has a definitional theory of truth. That extension has a semantical theory of truth, if every sentence of the…

Logic · Mathematics 2020-02-04 Seppo Heikkilä

This paper presents rules of inference for a binary quantifier $I$ for the formalisation of sentences containing definite descriptions within intuitionist positive free logic. $I$ binds one variable and forms a formula from two formulas.…

Logic in Computer Science · Computer Science 2021-08-12 Nils Kürbis

This paper focuses on succinctness results for fragments of Linear Temporal Logic with Past (LTL) devoid of binary temporal operators like until, and provides methods to establish them. We prove that there is a family of cosafety languages…

Logic in Computer Science · Computer Science 2024-06-18 Luca Geatti , Alessio Mansutti , Angelo Montanari

The need for a time-shift invariant formulation of quantum theory arises from fundamental symmetry principles as well as heuristic cosmological considerations. Such a description then leaves open the question of how to reconcile global…

Quantum Physics · Physics 2019-06-26 Leon Loveridge , Takayuki Miyadera

Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…

Logic · Mathematics 2024-04-29 Fredrik Engström

We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary…

Logic · Mathematics 2022-12-14 Merlin Carl , Lorenzo Galeotti , Robert Passmann

We prove that the positive fragment of first-order intuitionistic logic in the language with two variables and a single monadic predicate letter, without constants and equality, is undecidable. This holds true regardless of whether we…

Logic in Computer Science · Computer Science 2022-06-14 Mikhail Rybakov , Dmitry Shkatov

The interpretability logic of a mathematical theory describes the structural behavior of interpretations over that theory. Different theories have different logics. This paper from 2011 revolves around the question what logic describes the…

Logic · Mathematics 2020-04-16 Evan Goris , Joost J. Joosten

The (consistent or decoherent) histories interpretation provides a consistent realistic ontology for quantum mechanics, based on two main ideas. First, a logic (system of reasoning) is employed which is compatible with the Hilbert-space…

Quantum Physics · Physics 2013-02-13 Robert B. Griffiths

Prawitz conjectured that the proof-theoretically valid logic is intuitionistic logic. Recent work on proof-theoretic validity has disproven this. In fact, it has been shown that proof-theoretic validity is not even closed under…

Logic · Mathematics 2022-11-24 Will Stafford , Victor Nascimento

In generic realizability for set theories, realizers treat unbounded quantifiers generically. To this form of realizability, we add another layer of extensionality by requiring that realizers ought to act extensionally on realizers, giving…

Logic · Mathematics 2020-12-22 Emanuele Frittaion , Michael Rathjen

Ability to count number of occurrences of events within a specified time interval is very useful in specification of resource bounded real time computation. In this paper, we study an extension of Metric Temporal Logic ($\mathsf{MTL}$) with…

Logic in Computer Science · Computer Science 2015-12-31 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh Pandya

The classic paper of Clauser et al proved that Bell's Theorem experiments rule out all theories of physics which assume locality, time-forwards causality and the existence of an objective real world. The Backwards-Time Interpretation (BTI)…

Quantum Physics · Physics 2007-05-23 Paul J. Werbos , Ludmila Dolmatova

While a large body of work has scrutinized the meaning of conditional sentences, considerably less attention has been paid to formal models of their pragmatic use and interpretation. Here, we take a probabilistic approach to pragmatic…

Computation and Language · Computer Science 2022-10-14 Britta Grusdt , Daniel Lassiter , Michael Franke

In this paper, we present an interactive semantics for derivations in an infinitary extension of classical logic. The formulas of our language are possibly infinitary trees labeled by propositional variables and logical connectives. We show…

Logic in Computer Science · Computer Science 2014-09-12 Michele Basaldella