English
Related papers

Related papers: Elements of Librationism

200 papers

The link between forced and free fluctuations for nonequilibrium systems can be described via a generalized version of the celebrated fluctuation-dissipation theorem. The use of the formalism of the Koopman operator makes it possible to…

Statistical Mechanics · Physics 2025-06-23 Valerio Lucarini , Manuel Santos Gutierrez , John Moroney , Niccolò Zagli

We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…

Logic · Mathematics 2020-07-15 Alexandre Miquel

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…

Artificial Intelligence · Computer Science 2013-02-18 Salem Benferhat , Didier Dubois , Henri Prade

We introduce a new version of arithmetic in all finite types which extends the usual versions with primitive notions of extensionality and extensional equality. This new hybrid version allows us to formulate a strong form of extensionality,…

Logic · Mathematics 2023-10-26 Benno van den Berg

We describe a new method of finding interpolants for classical logic using certain refutation system as a starting point. Refutation can be thought of as an alternative approach to the analysis of formal systems: instead of focusing on…

Logic in Computer Science · Computer Science 2026-03-18 Adam Trybus , Karolina Rożko , Tomasz Skura

We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract…

Logic in Computer Science · Computer Science 2023-07-25 Ulrich Berger , Hideki Tsuiki

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

Artificial Intelligence · Computer Science 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

Abductive reasoning is a popular non-monotonic paradigm that aims to explain observed symptoms and manifestations. It has many applications, such as diagnosis and planning in artificial intelligence and database updates. In propositional…

Artificial Intelligence · Computer Science 2026-01-14 Johannes Schmidt , Mohamed Maizia , Victor Lagerkvist , Johannes K. Fichte

LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as proofs of correctness of decision procedures for LF's…

Logic in Computer Science · Computer Science 2010-05-04 Christian Urban , James Cheney , Stefan Berghofer

We define forcing orders which add witnesses to the failure of various forms of Friedman's Property. These posets behave similarly to the forcing order adding a nonreflecting stationary set but have the advantage of allowing the…

Logic · Mathematics 2024-11-05 Hannes Jakob

This paper considers derivation of $f$-divergence inequalities via the approach of functional domination. Bounds on an $f$-divergence based on one or several other $f$-divergences are introduced, dealing with pairs of probability measures…

Information Theory · Computer Science 2016-10-31 Igal Sason , Sergio Verdú

It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Schlicht

Fractional calculus is a generalization of classical theories of integration and differentiation to arbitrary order (i.e., real or complex numbers). In the last two decades, this new mathematical modeling approach has been widely used to…

Logic in Computer Science · Computer Science 2016-08-10 Umair Siddique , Osman Hasan , Sofiène Tahar

Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…

Rings and Algebras · Mathematics 2020-07-15 Konrad Schrempf

Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been…

Computational Complexity · Computer Science 2010-09-13 Michael Thomas , Heribert Vollmer

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

Logic · Mathematics 2016-11-15 Giuseppe Greco , Alessandra Palmigiano

We propose an extension of Poole's independent choice logic based on a relaxation of the underlying independence assumptions. A credal semantics involving multiple joint probability mass functions over the possible worlds is adopted. This…

Logic in Computer Science · Computer Science 2018-06-22 Alessandro Antonucci , Alessandro Facchini

This is the first of four papers prompted by a recent literature about a doctrine dubbed spacetime functionalism. This paper gives our general framework for discussing functionalism. Following Lewis, we take it as a species of reduction. We…

History and Philosophy of Physics · Physics 2020-09-01 J. Butterfield , H. Gomes

The paper introduces a basic logic of knowledge and abduction by extending Levesque logic of only-knowing with an abduction modal operator defined via the combination of basic epistemic concepts. The upshot is an alternative approach to…

Artificial Intelligence · Computer Science 2026-01-09 Sanderson Molick , Vaishak Belle

We study the expressive power of fragments of inclusion and independence logic defined by restricting the number k of universal quantifiers in formulas. Assuming the so-called strict semantics for these logics, we relate these fragments of…

Logic · Mathematics 2014-01-15 Miika Hannula , Juha Kontinen