English
Related papers

Related papers: Temporal interpretation of intuitionistic quantifi…

200 papers

We define a Kripke semantics for a conditional logic based on the propositional logic $\mathsf{N4}$, the paraconsistent variant of Nelson's logic of strong negation; we axiomatize the minimal system induced by this semantics. The resulting…

Logic · Mathematics 2023-11-07 Grigory K. Olkhovikov

We investigate an operator on classes of languages. For each class $C$, it outputs a new class $FO^2(I_C)$ associated with a variant of two-variable first-order logic equipped with a signature$I_C$ built from $C$. For $C = \{\emptyset,…

Formal Languages and Automata Theory · Computer Science 2023-11-30 Thomas Place , Marc Zeitoun

This paper investigates the possibility of performing automated reasoning in probabilistic logic when probabilities are expressed by means of linguistic quantifiers. Each linguistic term is expressed as a prescribed interval of proportions.…

Artificial Intelligence · Computer Science 2013-03-25 Didier Dubois , Henri Prade , Lluis Godo , Ramon Lopez de Mantaras

The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…

Logic · Mathematics 2025-10-06 Mikhail Rybakov

In this paper we present various temporal justification logics involving both past and future time modalities. We combine Artemov's logic of proofs with linear temporal logic (with both past and future operators), and establish its…

Logic in Computer Science · Computer Science 2025-01-17 Meghdad Ghari

We develop polytopological semantics for various constructive, intuitionistic, and G\"odel--Dummett variations of $\mathsf{K4}$ and $\mathsf{S4}$. In our models, intuitionistic and modal operators are interpreted via various topologies over…

Logic · Mathematics 2026-04-28 Juan P. Aguilera , David Fernández-Duque , Leonardo Pacheco

It is known that not only classical semantics but also intuitionistic Kripke semantics can be generalized so that it can treat arbitrary propositional connectives characterized by truth tables, or truth functions. In our previous work, it…

Logic · Mathematics 2021-07-09 Naosuke Matsuda , Kento Takagi

We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae.…

Logic in Computer Science · Computer Science 2016-09-15 Miika Hannula , Juha Kontinen , Martin Lück , Jonni Virtema

The ability to predict the future in a given domain can be acquired by discovering empirically from experience certain temporal patterns that tend to repeat unerringly. Previous works in time series analysis allow one to make quantitative…

Artificial Intelligence · Computer Science 2013-04-12 Kaihu Chen

In this paper, we introduce a proof system $\mathsf{NQGL}$ for a Kripke complete predicate extension of the logic $\mathbf{GL}$, that is, the logic of provability, which is defned by $\mathbf{K}$ and the L\"{o}b formula $\Box(\Box p\supset…

Logic · Mathematics 2023-02-22 Yoshihito Tanaka

Various verification techniques for temporal properties transform temporal verification to safety verification. For infinite-state systems, these transformations are inherently imprecise. That is, for some instances, the temporal property…

Logic in Computer Science · Computer Science 2021-06-03 Oded Padon , Jochen Hoenicke , Kenneth L. McMillan , Andreas Podelski , Mooly Sagiv , Sharon Shoham

We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…

Logic in Computer Science · Computer Science 2021-06-17 Jan Triska , Vilem Vychodil

The quantum measurement problem is often presented as a conflict between unitary evolution and non-unitary collapse. Drawing on Wittgenstein's later philosophy of language and Bohr's principle of complementarity, we argue that this conflict…

Quantum Physics · Physics 2025-10-02 Partha Ghose

We introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…

Logic in Computer Science · Computer Science 2026-05-06 Tim S. Lyon

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

Logic · Mathematics 2012-07-26 Joel David Hamkins , George Leibman , Benedikt Löwe

We study an intuitionistic version of common knowledge logic (CK), called ICK, which was introduced by J\"ager and Marti. ICK extends intuitionistic propositional logic (IPL) by multiple box modalities interpreted as knowledge operators for…

Logic · Mathematics 2026-05-04 Lukas Zenger

We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of…

Logic in Computer Science · Computer Science 2016-10-27 Emil Jeřábek

According to quantum mechanics, statements about the future made by sentient beings like us are, in general, neither true nor false; they must satisfy a many-valued logic. I propose that the truth value of such a statement should be…

Quantum Physics · Physics 2017-10-24 Anthony Sudbery

This paper undertakes a re-examination of Sir William Hamilton's doctrine of the quantification of the predicate. Hamilton's doctrine comprises two theses. First, the predicates of traditional syllogistic sentence-forms contain implicit…

Logic in Computer Science · Computer Science 2024-04-24 Ian Pratt-Hartmann

We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e.,…

Logic in Computer Science · Computer Science 2019-01-23 Mikhail Rybakov , Dmitry Shkatov