English
Related papers

Related papers: An intuitionistic axiomatization of `eventually'

200 papers

We introduce a basic intuitionistic conditional logic $\mathsf{IntCK}$ that we show to be complete both relative to a special type of Kripke models and relative to a standard translation into first-order intuitionistic logic. We show that…

Logic · Mathematics 2023-06-21 Grigory Olkhovikov

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…

Logic in Computer Science · Computer Science 2022-05-25 Luca Geatti , Alessandro Gianola , Nicola Gigante

The expressiveness of Metric Temporal Logic (MTL) has been extensively studied throughout the last two decades. In particular, it has been shown that the \emph{interval-based} semantics of MTL is strictly more expressive than the…

Logic in Computer Science · Computer Science 2026-03-20 Mohammed Aristide Foughali

The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and…

Logic in Computer Science · Computer Science 2019-11-20 Laura Bozzelli , Aniello Murano , Adriano Peron

In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general models and have a natural definition. As a class they do not…

Logic · Mathematics 2007-05-23 Reinhard Muskens

The importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of view, intuitionistic temporal logics have made it possible…

Logic in Computer Science · Computer Science 2023-06-22 Joseph Boudou , Martín Diéguez , David Fernández-Duque , Philip Kremer

A predicate linear temporal logic LTL_{\lambda,=} without quantifiers but with predicate abstraction mechanism and equality is considered. The models of LTL_{\lambda,=} can be naturally seen as the systems of pebbles (flexible constants)…

Logic in Computer Science · Computer Science 2007-05-23 Alexei Lisitsa , Igor Potapov

We study an extension of $\mtl$ in pointwise time with rational expression guarded modality $\reg_I(\re)$ where $\re$ is a rational expression over subformulae. We study the decidability and expressiveness of this extension ($\mtl$+$\varphi…

Logic in Computer Science · Computer Science 2017-05-04 Shankara Narayanan Krishna , Khushraj Madnani , P. K. Pandya

The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logic which is a semantical fragment of the logic…

Logic in Computer Science · Computer Science 2015-03-17 Ahmet Kara , Thomas Schwentick , Thomas Zeume

We generalize intuitionistic tense logics to the multi-modal case by placing grammar logics on an intuitionistic footing. We provide axiomatizations for a class of base intuitionistic grammar logics as well as provide axiomatizations for…

Logic · Mathematics 2021-10-05 Tim S. Lyon

Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running systems. One can consider more general models for linear time,…

Logic in Computer Science · Computer Science 2011-01-11 Julien Cristau

We develop a timeout based extension of propositional linear temporal logic (which we call TLTL) to specify timing properties of timeout based models of real time systems. TLTL formulas explicitly refer to a running global clock together…

Logic in Computer Science · Computer Science 2010-12-20 Janardan Misra , Suman Roy

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

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed…

Artificial Intelligence · Computer Science 2011-05-30 A. Artale , E. Franconi

LTL3 is a multi-valued variant of Linear-time Temporal Logic for runtime verification applications. The semantic descriptions of LTL3 in previous work are given only in terms of the relationship to conventional LTL. Our approach, by…

Logic in Computer Science · Computer Science 2024-11-25 Rayhana Amjad , Rob van Glabbeek , Liam O'Connor

The formal system of intuitionistic epistemic logic IEL was proposed by S. Artemov and T. Protopopescu. It provides the formal foundation for the study of knowledge from an intuitionistic point of view based on Brouwer-Hayting-Kolmogorov…

Logic in Computer Science · Computer Science 2015-09-01 Vladimir N. Krupski , Alexey Yatmanov

Metric Temporal Logic, $\mtlfull$ is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval…

Logic in Computer Science · Computer Science 2013-11-28 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh K. Pandya

Abashidze and Blass independently proved that the modal logic $\sf{GL}$ is complete for its topological interpretation over any ordinal greater than or equal to $\omega^\omega$ equipped with the interval topology. Icard later introduced a…

Logic · Mathematics 2015-11-19 Juan P. Aguilera , David Fernández-Duque

Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) extend Linear Temporal Logic (LTL) for real-time constraints, with MTL using time-bounded modalities and TPTL employing freeze quantifiers. Satisfiability for both is…

Logic in Computer Science · Computer Science 2024-11-04 Shankara Narayanan Krishna , Khushraj Madnani , Agnipratim Nag , Paritosh Pandya

A unified Gentzen-style framework for until-free propositional linear-time temporal logic is introduced. The proposed framework, based on infinitary rules and rules for primitive negation, can handle uniformly both a single-succedent…

Logic in Computer Science · Computer Science 2025-01-03 Norihiro Kamide , Sara Negri