English
Related papers

Related papers: Preservation under Reduced Products in Continuous …

200 papers

This paper concerns an expansion of first-order Belnap-Dunn logic whose connectives and quantifiers all have a counterpart in classical logic. The language and logical consequence relation of this paradefinite logic are defined, a sequent…

Logic in Computer Science · Computer Science 2026-03-04 C. A. Middelburg

We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…

Logic · Mathematics 2024-11-08 Nicolas Chavarria

We introduce a logic for knowledge representation and reasoning on protein-protein interactions. Modulo a theory, formulas describe protein structures and dynamic changes. They can be composed in order to add or remove static and dynamic…

Logic in Computer Science · Computer Science 2019-09-19 Adrien Husson , Jean Krivine

We define a fragment of metric first-order temporal logic formulas that guarantees the finiteness of their table representations. We extend our fragment's definition to cover the temporal dual operators trigger and release and show that our…

Logic in Computer Science · Computer Science 2022-06-20 Jonathan Julian Huerta y Munive

One of the main claims of the paper is that Dirac's calculus and broader theories of physics can be treated as theories written in the language of Continuous Logic. Establishing its true interpretation (model) is a model theory problem. The…

Logic · Mathematics 2024-10-04 Boris Zilber

Subatomic logic is a recent innovation in structural proof theory where atoms are no longer the smallest entity in a logical formula, but are instead treated as binary connectives. As a consequence, we can give a subatomic proof system for…

Logic in Computer Science · Computer Science 2025-05-27 Victoria Barrett , Alessio Guglielmi , Benjamin Ralph , Lutz Straßburger

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

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

Logic · Mathematics 2025-08-12 Mauro Avon

We develop a bottom-up approach to truth-value semantics for classical logic of partial terms based on equality and apply it to prove the conservativity of the addition of partial description and partial selection functions, independently…

Logic · Mathematics 2016-02-10 Franco Parlamento

A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…

Logic in Computer Science · Computer Science 2007-06-25 Christophe Fouqueré

Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL…

Artificial Intelligence · Computer Science 2026-01-22 Ritam Raha , Rajarshi Roy , Nathanaël Fijalkow , Daniel Neider

The model theory of a first-order logic called N^4 is introduced. N^4 does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N^4 is very close to classical logic: N^4 has two truth values;…

Logic in Computer Science · Computer Science 2007-05-23 François Bry

A classical reconstruction of Wright's first-order logic of strict finitism is presented. Strict finitism is a constructive standpoint of mathematics that is more restrictive than intuitionism. Wright sketched the semantics of said logic in…

Logic · Mathematics 2024-08-13 Takahiro Yamada

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Logic in Computer Science · Computer Science 2010-10-01 Alwen Tiu , Alberto Momigliano

This paper proves continuity of value functions in discounted periodic-review single-commodity total-cost inventory control problems with \revision{continuous inventory levels,} fixed ordering costs, possibly bounded inventory storage…

Optimization and Control · Mathematics 2022-07-27 Eugene A. Feinberg , David N. Kraemer

We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…

Logic · Mathematics 2014-04-16 Lauri Hella , Antti Kuusisto

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…

Logic · Mathematics 2023-11-09 Tim S. Lyon , Eugenio Orlandelli

Continuum mechanics with dislocations, with the Cattaneo type heat conduction, with mass transfer, and with electromagnetic fields is put into the Hamiltonian form and into the form of the Godunov type system of the first order, symmetric…

Classical Physics · Physics 2018-02-14 Ilya Peshkov , Michal Pavelka , Evgeniy Romenski , Miroslav Grmela

A new form of governing equations is derived from Hamilton's principle of least action for a constrained Lagrangian, depending on conserved quantities and their derivatives with respect to the time-space. This form yields conservation laws…

Fluid Dynamics · Physics 2008-01-16 Sergey Gavrilyuk , Henri Gouin

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…

Logic · Mathematics 2010-06-14 Farzad Didehvar , Kaveh Ghasemloo , Massoud Pourmahdian