English
Related papers

Related papers: A Higher Bachmann-Howard Principle

200 papers

We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…

Logic in Computer Science · Computer Science 2022-08-02 David M. Cerna , Temur Kutsia

Approximation Fixpoint Theory (AFT) is an algebraic framework designed to study the semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-order definitions. To solve such an issue, we devise a…

Logic in Computer Science · Computer Science 2026-01-14 Samuele Pollaci , Babis Kostopoulos , Marc Denecker , Bart Bogaerts

We use the Fr\"olicher-Nijenhuis formalism to reformulate the inverse problem of the calculus of variations for a system of differential equations of order 2k in terms of a semi-basic 1-form of order k. Within this general context, we use…

Differential Geometry · Mathematics 2013-10-01 Ioan Bucataru

It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting…

Logic in Computer Science · Computer Science 2024-11-20 Tim S. Lyon , Ian Shillito , Alwen Tiu

A generalized notion of higher order nonclassicality (in terms of higher order moments) is introduced. Under this generalized framework of higher order nonclassicality, conditions of higher order squeezing and higher order subpoissonian…

Quantum Physics · Physics 2022-06-07 Amit Verma , Anirban Pathak

The paper proves finite model property and decidability for a family of modal logics. A binary relation $R$ is called pretransitive, if $R^*=\cup_{i\leq m} R^i$ for some $m\geq 0$, where $R^*$ is the transitive reflexive closure of $R$. By…

Logic · Mathematics 2015-12-01 Andrey Kudinov , Ilya Shapirovsky

We show that in the category of preordered sets, there is a natural notion of pretorsion theory, in which the partially ordered sets are the torsion-free objects and the sets endowed with an equivalence relation are the torsion objects.…

Category Theory · Mathematics 2019-02-19 Alberto Facchini , Carmelo Finocchiaro

Starting with a likelihood or preference order on worlds, we extend it to a likelihood ordering on sets of worlds in a natural way, and examine the resulting logic. Lewis (1973) earlier considered such a notion of relative likelihood in the…

Artificial Intelligence · Computer Science 2014-07-29 Joseph Y. Halpern

We study transfinite extensions of Japaridze's provability logic GLP and the well-founded relations that naturally occur within them. Every ordinal induces a partial order over the class of "words," which are iterated consistency statements…

Logic · Mathematics 2013-12-23 David Fernández-Duque , Joost J. Joosten

From a theory developed by C. Mehl, et al., a theory of the rank one perturbation of Hamiltonian systems with periodic coefficients is proposed. It is showed that the rank one perturbation of the fundamental solution of Hamiltonian system…

Numerical Analysis · Mathematics 2016-01-26 Mouhamadou Dosso , Arouna G. Y. Traore , Jean-Claude Koua Brou

The paper tries to extend results of the classical Descriptive Set Theory to as many countably based T_0-spaces (cb_0-spaces) as possible. Along with extending some central facts about Borel, Luzin and Hausdorff hierarchies of sets we…

General Topology · Mathematics 2014-06-17 Victor Selivanov

S. Gudder and, later, S. Pulmanova and E. Vincekova, have studied in two recent papers a certain ordering of bounded self-adjoint operators on a Hilbert space. We present some further results on this ordering and show that some structure…

Operator Algebras · Mathematics 2013-04-03 J. Cirulis

In this paper, we consider the problem of learning a first-order theorem prover that uses a representation of beliefs in mathematical claims to construct proofs. The inspiration for doing so comes from the practices of human mathematicians…

Artificial Intelligence · Computer Science 2019-07-01 Daniel Huang

We present automated theorem provers for the first-order logic of here and there (HT). They are based on a native sequent calculus for the logic of HT and an axiomatic embedding of the logic of HT into intuitionistic logic. The analytic…

Logic in Computer Science · Computer Science 2026-01-08 Jens Otten , Torsten Schaub

In ethics, individual responsibility is often defined through Frankfurt's principle of alternative possibilities. This definition is not adequate in a group decision-making setting because it often results in the lack of a responsible party…

Artificial Intelligence · Computer Science 2025-11-13 Junli Jiang , Pavel Naumov

Adapting Mourre's commutator method to the dissipative setting, we prove a limiting absorption principle for a class of abstract dissipative operators. A consequence is the resolvent estimates for the high frequency Helmholtz equation when…

Analysis of PDEs · Mathematics 2014-03-04 Julien Royer

Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of…

Programming Languages · Computer Science 2020-12-03 Chris Heunen , Ohad Kammar , Sam Staton , Hongseok Yang

Ordered phases of matter, such as solids, ferromagnets, superfluids, or quantum topological order, typically only exist at low temperatures. Despite this conventional wisdom, we present explicit local models in which all such phases persist…

Statistical Mechanics · Physics 2025-04-01 Yiqiu Han , Xiaoyang Huang , Zohar Komargodski , Andrew Lucas , Fedor K. Popov

Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…

Logic · Mathematics 2021-05-27 Predrag Tanović , Slavko Moconja , Dejan Ilić

We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…

Combinatorics · Mathematics 2019-09-20 Michael Albert , Mathilde Bouvel , Valentin Féray