English
Related papers

Related papers: Robinson consistency in many-sorted hybrid first-o…

200 papers

The Robinson Splitting Theorem states that a c.e. degree $\mathbf{b}$ splits over any low c.e. degree $\mathbf{c}<\mathbf{b}$. We prove that a weaker version of this theorem holds in models of $\mathrm{P}^-+\mathrm{I}\Sigma_1$, with lowness…

Logic · Mathematics 2026-03-05 Yong Liu , Cheng Peng , Mengzhou Sun

Inspired by multigrid methods for linear systems of equations, multilevel optimization methods have been proposed to solve structured optimization problems. Multilevel methods make more assumptions regarding the structure of the…

Optimization and Control · Mathematics 2019-11-27 Chin Pang Ho , Michal Kocvara , Panos Parpas

A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…

Logic · Mathematics 2007-05-23 Saharon Shelah

We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…

Logic · Mathematics 2016-09-06 Alessandra Carbone

In this article, a model-theoretic approach is proposed to prove that the first-order G\"odel logic, $\mathbf{G}$, as well as its extension $\mathbf{G}^\Delta$ associated with first-order relational languages enjoy the Craig interpolation…

In the spirit of a theorem of Wood, we give necessary and sufficient conditions for a family of germs of analytic hypersurfaces in a smooth projective toric variety X to be interpolated by an algebraic hypersurface with a fixed class in the…

Complex Variables · Mathematics 2007-05-23 Martin Weimann

We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and…

Logic in Computer Science · Computer Science 2016-03-27 Stefan Hetzl , Lutz Straßburger

Let C_n(M) be the configuration space of n distinct ordered points in M. We prove that if M is any connected orientable manifold (closed or open), the homology groups H_i(C_n(M); Q) are representation stable in the sense of [Church-Farb].…

Algebraic Topology · Mathematics 2013-03-13 Thomas Church

We revisit the work studying homomorphism preservation for first-order logic in sparse classes of structures initiated in [Atserias et al., JACM 2006] and [Dawar, JCSS 2010]. These established that first-order logic has the homomorphism…

Logic in Computer Science · Computer Science 2024-05-21 Anuj Dawar , Ioannis Eleftheriadis

We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a…

Logic in Computer Science · Computer Science 2017-01-11 Lars Birkedal , Rasmus E. Møgelberg , Rasmus Lerchedahl Petersen

Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…

Logic · Mathematics 2026-03-17 Yuki Nishimura

We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.

Logic · Mathematics 2021-11-15 Samuel Braunfeld , Matthew Kukla

A canonical result in model theory is the homomorphism preservation theorem (h.p.t.) which states that a first-order formula is preserved under homomorphisms iff it is equivalent to an existential-positive formula, standardly proved via a…

Logic · Mathematics 2026-01-14 James Carr

We present a first-order probabilistic epistemic logic, which allows combining operators of knowledge and probability within a group of possibly infinitely many agents. The proposed framework is the first order extension of the logic of…

Logic in Computer Science · Computer Science 2019-01-23 Siniša Tomović , Zoran Ognjanović , Dragan Doder

Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…

Logic in Computer Science · Computer Science 2026-03-31 Mirai Ikebuchi

We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform…

We say that a convergence law holds for a sequence of random combinatorial objects if, for any first-order sentence $\varphi$, the proportion of objects satisfying $\varphi$ converges to a limiting value as the size of the objects tends to…

Probability · Mathematics 2026-03-20 Alperen Özdemir

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

Combinatorics · Mathematics 2021-10-29 C P Anil Kumar

The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of…

Logic · Mathematics 2020-08-13 Balthasar Grabmayr

We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…

Representation Theory · Mathematics 2015-06-17 Steven V Sam , Andrew Snowden
‹ Prev 1 3 4 5 6 7 10 Next ›