English
Related papers

Related papers: Definite Descriptions and Hybrid Tense Logic

200 papers

We define a notion which contains numerous basic notions of Analysis as special cases, for example limit, continuity, differential, Riemann and Lebesgue integral, root and exponential functions. Properties like additivity or linearity of…

Classical Analysis and ODEs · Mathematics 2015-07-07 Matthias Mossburger

In the present article, we extend the fragment of inductive formulas for the hybrid language L(@) in [8] including a McKinsey-like formula, and show that every formula in the extended class has a first-order correspondent, by modifying the…

Logic · Mathematics 2022-10-11 Zhiguang Zhao

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

Logic in Computer Science · Computer Science 2026-05-05 Victor Barroso-Nascimento , Maria Osório , Elaine Pimentel

Inquisitive team logic is a variant of inquisitive logic interpreted in team semantics, which has been argued to provide a natural setting for the regimentation of dependence claims. With respect to sentences, this logic is known to be…

Logic · Mathematics 2026-03-10 Juha Kontinen , Ivano Ciardelli

It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type…

Computation and Language · Computer Science 2024-02-14 Sergey Slavnov

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…

Logic · Mathematics 2023-03-21 Davide Emilio Quadrellaro

We bring an abstract model theory perspective to interpolation. We ask, what is the role of interpolation in the study of extensions of first order logic, such as infinitary logics, generalized quantifiers and higher order logics? The…

Logic · Mathematics 2025-07-28 Jouko Väänänen

Rational inference relations were introduced by Lehmann and Magidor as the ideal systems for drawing conclusions from a conditional base. However, there has been no simple characterization of these relations, other than its original…

Logic in Computer Science · Computer Science 2007-05-23 Konstantinos Georgatos

Logics of limited belief aim at enabling computationally feasible reasoning in highly expressive representation languages. These languages are often dialects of first-order logic with a weaker form of logical entailment that keeps reasoning…

Artificial Intelligence · Computer Science 2017-05-05 Christoph Schwering

We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of…

A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…

Logic · Mathematics 2026-01-06 Maciej Malicki

In this article, we examine how clausal resolution can be applied to a specific, but widely used, non-classical logic, namely discrete linear temporal logic. Thus, we first define a normal form for temporal formulae and show how arbitrary…

Logic in Computer Science · Computer Science 2007-05-23 Michael Fisher , Clare Dixon , Martin Peim

This text gives a rough, but linear summary covering some key definitions, notations, and propositions from Lambda Calculus: Its Syntax and Semantics, the classical monograph by Barendregt. First, we define a theory of untyped extensional…

Logic in Computer Science · Computer Science 2013-10-28 Anton Salikhmetov

We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…

Logic in Computer Science · Computer Science 2020-08-17 Richard Moot

Deontic logic is a very well researched branch of mathematical logic and philosophy. Various kinds of deontic logics are discussed for different application domains like argumentation theory, legal reasoning, and acts in multi-agent…

Artificial Intelligence · Computer Science 2018-09-17 Ulrich Furbach , Claudia Schon , Frieder Stolzenburg

We establish a correspondence between (fragments of) $\mathcal{TEL}^\bigcirc$, a temporal extension of the $\mathcal{EL}$ description logic with the LTL operator $\bigcirc^k$, and some specific kinds of formal grammars, in particular,…

Logic in Computer Science · Computer Science 2025-08-04 Camille Bourgaux , Anton Gnatenko , Michaël Thomazo

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…

Logic in Computer Science · Computer Science 2015-07-30 Charles Paperman

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson

In this paper we propose a many-valued temporal conditional logic. We start from a many-valued logic with typicality, and extend it with the temporal operators of the Linear Time Temporal Logic (LTL), thus providing a formalism which is…

Logic in Computer Science · Computer Science 2024-09-17 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics extended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest Fixed Point Logic, and we prove that all…

Logic in Computer Science · Computer Science 2013-05-01 Pietro Galliani , Lauri Hella