中文
相关论文

相关论文: Temporal interpretation of intuitionistic quantifi…

200 篇论文

Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics, in particular using the…

人工智能 · 计算机科学 2025-11-18 Piotr Gorczyca , Hannes Strass

We consider intuitionistic variants of linear temporal logic with `next', `until' and `release' based on expanding posets: partial orders equipped with an order-preserving transition function. This class of structures gives rise to a logic…

计算机科学中的逻辑 · 计算机科学 2020-01-01 Philippe Balbiani , Joseph Boudou , Martín Diéguez , David Fernández-Duque

Until recently, First-Order Temporal Logic (FOTL) has been little understood. While it is well known that the full logic has no finite axiomatisation, a more detailed analysis of fragments of the logic was not previously available. However,…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Anatoly Degtyarev , Michael Fisher , Boris Konev

We present the logic iJT4, which is an explicit version of intuitionistic S4 and establish soundness and completeness with respect to modular models.

逻辑 · 数学 2016-04-26 Michel Marti , Thomas Studer

A famous result, conjectured by G\"odel in 1932 and proved by McKinsey and Tarski in 1948, says that $\varphi$ is a theorem of intuitionistic propositional logic IPC iff its G\"odel-translation $\varphi'$ is a theorem of modal logic S4. In…

计算机科学中的逻辑 · 计算机科学 2015-08-05 Steffen Lewitzka

We propose a "modal linear logic" to reformulate intuitionistic modal logic S4 (IS4) in terms of linear logic, establishing an S4-version of Girard translation from IS4 to it. While the Girard translation from intuitionistic logic to linear…

计算机科学中的逻辑 · 计算机科学 2019-04-25 Yosuke Fukuda , Akira Yoshimizu

In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M-imply) is PSPACE-complete. He showed a polynomially bounded translation from full Intuitionistic Propositional Logic into…

计算机科学中的逻辑 · 计算机科学 2015-04-13 Edward Hermann Haeusler

We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Benedikt Bollig , Dietrich Kuske , Ingmar Meinecke

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…

逻辑 · 数学 2016-05-02 Silvio Ghilardi , Samuel J. van Gool

Monadic Second-Order Logic (MSO) extends First-Order Logic (FO) with variables ranging over sets and quantifications over those variables. We introduce and study Monadic Tree Logic (MTL), a fragment of MSO interpreted on infinite-tree…

计算机科学中的逻辑 · 计算机科学 2023-04-25 Massimo Benerecetti , Laura Bozzelli , Fabio Mogavero , Adriano Peron

We study the notion of conservative translation between logics introduced by Feitosa and D'Ottaviano. We show that classical propositional logic (CPC) is universal in the sense that every finitary consequence relation over a countable set…

逻辑 · 数学 2012-11-29 Emil Jeřábek

We study the correspondence theory of intuitionistic modal logic in modal Fairtlough-Mendler semantics (modal FM semantics) \cite{FaMe97}, which is the intuitionistic modal version of possibility semantics \cite{Ho16}. We identify the…

逻辑 · 数学 2022-10-06 Zhiguang Zhao

We study what we call topological cylindric algebras and tense cylindric algebras defined for every ordinal $\alpha$. The former are cylindric algebras of dimension $\alpha$ expanded with $\sf S4$ modalities indexed by $\alpha$. The…

逻辑 · 数学 2014-02-26 Tarek Sayed Ahmed

This paper investigates the contingency of logic within the framework of possible world semantics. Possible world semantics captures the meaning of necessitation, i.e., a statement is necessarily true if it holds in all possible worlds.…

We consider G\"odel temporal logic ($\sf GTL$), a variant of linear temporal logic based on G\"odel--Dummett propositional logic. In recent work, we have shown this logic to enjoy natural semantics both as a fuzzy logic and as a…

计算机科学中的逻辑 · 计算机科学 2022-12-05 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

We introduce bisimulations for the logic $ITL^e$ with `next', `until' and `release', an intuitionistic temporal logic based on structures equipped with a partial order used to interpret intuitionistic implication and a monotone function…

We consider Minkowski spacetime, the set of all point-events of spacetime under the relation of causal accessibility. That is, ${\sf x}$ can access ${\sf y}$ if an electromagnetic or (slower than light) mechanical signal could be sent from…

逻辑 · 数学 2017-06-13 Robin Hirsch , Mark Reynolds

We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…

计算机科学中的逻辑 · 计算机科学 2016-11-01 Robert Constable , Mark Bickford

In this paper we analyse logic of false belief in intuitionistic setting. This logic, studied in its classical version by Steinsvold, Fan, Gilbert and Venturi, describes the following situation: a formula F is not satisfied in a given…

逻辑 · 数学 2020-12-16 Tomasz Witczak

Temporal reasoning with conditionals is more complex than both classical temporal reasoning and reasoning with timeless conditionals, and can lead to some rather counter-intuitive conclusions. For instance, Aristotle's famous "Sea Battle…

计算机科学中的逻辑 · 计算机科学 2024-05-28 Fengkui Ju , Gianluca Grilletti , Valentin Goranko