English
Related papers

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

200 papers

It is well known that many-sorted logic can be reduced to unsorted first-order logic by adding predicates for each sort, relativizing quantifiers to these predicates, and adding appropriate axioms governing their behavior. Existing…

Logic · Mathematics 2026-05-19 Hrafn Valtýr Oddsson

We prove the Avrunin-Scott theorem for quantum complete intersections; the rank variety of a module is isomorphic to its support variety.

K-Theory and Homology · Mathematics 2008-10-21 Petter Andreas Bergh , Karin Erdmann

In this paper we build an Orlik-Solomon model for the canonical gradation of the cohomology algebra with integer coefficients of the complement of a toric arrangement. We give some results on the uniqueness of the representation of…

Algebraic Topology · Mathematics 2020-07-20 Roberto Pagaria

We consider the following property of a first order theory T with a distinguished unary predicate P: every model of the theory of P occurs as the P-part of some model of T. We call this property the Gaifman property. Gaifman conjectured…

Logic · Mathematics 2025-07-18 Saharon Shelah , Alexander Usvyatsov

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…

Logic in Computer Science · Computer Science 2007-05-23 Jørgen Villadsen

In this paper, a proof-theoretic method to prove uniform Lyndon interpolation for non-normal modal and conditional logics is introduced and applied to show that the logics $\mathsf{E}$, $\mathsf{M}$, $\mathsf{EN}$, $\mathsf{MN}$,…

Logic · Mathematics 2022-08-11 Amirhossein Akbar Tabatabai , Rosalie Iemhoff , Raheleh Jalali

This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many…

We prove an interpolation result for homogeneous polynomials over the integers, or more generally for PIDs with finite residue fields. Previous proofs of this result use the well-known but nontrivial fact that class groups of rings of…

Commutative Algebra · Mathematics 2020-09-24 John Berman , Daniel Erman

The Omitting Types Theorem in model theory and the Baire Category Theorem in topology are known to be closely linked. We examine the precise relation between these two theorems. Working with a general notion of logic we show that the…

Logic · Mathematics 2017-10-17 Christopher J. Eagle , Franklin D. Tall

A theorem of Eilenberg establishes that there exists a bijection between the set of all varieties of regular languages and the set of all varieties of finite monoids. In this article after defining, for a fixed set of sorts $S$ and a fixed…

Formal Languages and Automata Theory · Computer Science 2024-01-18 Juan Climent Vidal , Enric Cosme Llópez

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

Birkhoff's variety theorem, a fundamental theorem of universal algebra, asserts that a subclass of a given algebra is definable by equations if and only if it satisfies specific closure properties. In a generalized version of this theorem,…

Category Theory · Mathematics 2025-04-18 Yuto Kawase

The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].

Classical Analysis and ODEs · Mathematics 2019-10-03 K. Castillo , M. N. de Jesus , J. Petronilho

We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…

Logic in Computer Science · Computer Science 2021-04-28 Dominic Hughes , Lutz Straßburger , Jui-Hsuan Wu

We consider interpolation from the viewpoint of fully automated theorem proving in first-order logic as a general core technique for mechanized knowledge processing. For Craig interpolation, our focus is on the two-stage approach, where…

Logic in Computer Science · Computer Science 2026-01-12 Christoph Wernhard

In this paper, nonstandard multistep methods are considered. It is shown that under some (sufficient and necessary) conditions, these methods attain the same order as their standard counterparts - to prove this statement, a nonstandard…

Numerical Analysis · Mathematics 2026-01-19 Bálint Takács

The Quillen-McCord theorem (aka Quillen fiber lemma) gives a sufficient condition on a map between classifying spaces of posetal categories to be a homotopy equivalence. Jonathan Ariel Barmak in his paper [arXiv:1005.0538] gives an…

Algebraic Topology · Mathematics 2023-07-04 Vitalii Guzeev

We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…

Logic in Computer Science · Computer Science 2022-08-16 Yasha Savelyev

Short proof of the aperiodicity of the Robinson tile set.

Discrete Mathematics · Computer Science 2017-11-10 Thomas Fernique

In this paper we give an extension of the Birkhoff--Lewis theorem to some semilinear PDEs. Accordingly we prove existence of infinitely many periodic orbits with large period accumulating at the origin. Such periodic orbits bifurcate from…

Dynamical Systems · Mathematics 2007-05-23 Dario Bambusi , Massimiliano Berti