English
Related papers

Related papers: Scheme representation for first-order logic

200 papers

Resolution modulo is a first-order theorem proving method that can be applied both to first-order presentations of simple type theory (also called higher-order logic) and to set theory. When it is applied to some first-order presentations…

Logic in Computer Science · Computer Science 2023-06-02 Gilles Dowek

Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…

Algebraic Topology · Mathematics 2020-12-03 Karthik Boyareddygari

Toen has interpreted the schematization problem as originally imagined by Grothendieck in "Pursuing Stacks" in such a way that solution(s) to this problem could be given. As he pointed out, there are many solutions available, and he gave…

Algebraic Geometry · Mathematics 2022-05-05 Renaud Gauthier

We review some recent advances in modular representation theory of symmetric groups and related Hecke algebras. We discuss connections with Khovanov-Lauda-Rouquier algebras and gradings on the blocks of the group algebras $F\Sigma_n$, which…

Representation Theory · Mathematics 2014-05-15 Alexander Kleshchev

We use techniques from relative algebraic geometry and homotopical algebraic geometry in order to construct several categories of schemes defined "under Spec Z". We define this way the categories of N-schemes, F_1-schemes, S-schemes,…

Algebraic Geometry · Mathematics 2011-11-09 Bertrand Toen , Michel Vaquie

The cohomology theory known as Tmf, for "topological modular forms," is a universal object mapping out to elliptic cohomology theories, and its coefficient ring is closely connected to the classical ring of modular forms. We extend this to…

Algebraic Topology · Mathematics 2015-02-05 Michael Hill , Tyler Lawson

The notion of a glider representation of a chain of normal subgroups of a group is defined by a new structure, i.e. a fragment for a suitable filtration on the group ring. This is a special case of general glider representations defined for…

Rings and Algebras · Mathematics 2016-07-18 Frederik Caenepeel , Fred Van Oystaeyen

We explain how categories, and groupoids, can be seen as models for a Lawvere ${\mathfrak Gr}$-theory, where ${\mathfrak Gr}$ is the category of graphs, and show that for Lawvere ${\mathfrak Gr}$-theories finitely presentable models are…

Category Theory · Mathematics 2011-09-12 Kuerak Chung , Giovanni Marelli

We present a unified framework for representing commutative rings through affine algebraic theories and Boolean rings through hyperaffine algebraic theories. This yields categorical equivalences between these theories and, respectively,…

Logic · Mathematics 2026-03-02 Arturo De Faveri

The concept of a clone is central to many branches of mathematics, such as universal algebra, algebraic logic, and lambda calculus. Abstractly a clone is a category with two objects such that one is a countably infinite power of the other.…

Logic in Computer Science · Computer Science 2009-07-28 Zhaohua Luo

In this paper we present a novel approach to graph (and structural) limits based on model theory and analysis. The role of Stone and Gelfand dualities is displayed prominently and leads to a general theory, which we believe is naturally…

Combinatorics · Mathematics 2016-08-09 Jaroslav Nesetril , Patrice Ossona de Mendez

We introduce a generalization of degenerate affine Hecke algebra, called wreath Hecke algebra, associated to an arbitrary finite group G. The simple modules of the wreath Hecke algebra and of its associated cyclotomic algebras are…

Representation Theory · Mathematics 2008-11-01 Jinkui Wan , Weiqiang Wang

Despite recent advances in automating theorem proving in full first-order theories, inductive reasoning still poses a serious challenge to state-of-the-art theorem provers. The reason for that is that in first-order logic induction requires…

Logic in Computer Science · Computer Science 2021-07-19 Johannes Schoisswohl , Laura Kovács

There is an abstract notion of connection in any tangent category. In this paper, we show that when applied to the tangent category of affine schemes, this recreates the classical notion of a connection on a module (and similarly, in the…

Category Theory · Mathematics 2024-11-22 G. S. H. Cruttwell , Jean-Simon Pacaud Lemay , Elias Vandenberg

With a model of a geometric theory in an arbitrary topos, we associate a site obtained by endowing a category of generalized elements of the model with a Grothendieck topology, which we call the antecedent topology. Then we show that the…

Category Theory · Mathematics 2021-04-13 Olivia Caramello , Axel Osmond

In this article we present the basis of Monoid Theory from a categorical point of view, emphasizing the analogies and differences between the theory of modules over commutative rings. We present the generalization of afine schemes and afine…

Algebraic Geometry · Mathematics 2022-09-07 J. Rogelio Perez-Buendia , Ernesto Antonio Reyes-Ramirez

In this paper, a mathematical schema theory is developed. This theory has three roots: brain theory schemas, grid automata, and block-shemas. In Section 2 of this paper, elements of the theory of grid automata necessary for the mathematical…

Artificial Intelligence · Computer Science 2007-05-23 Mark Burgin

There is an interplay between models, specified by variables and equations, and their connections to one another. This dichotomy should be reflected in the abstract as well. Without referring to the models directly -- only that a model…

Algebraic Topology · Mathematics 2016-11-04 Michael Robinson

The notion of (symmetric) coloured operad or "multicategory" can be obtained from the notion of commutative algebra through a certain general process which we call "theorization" (where our term comes from an analogy with William Lawvere's…

Category Theory · Mathematics 2017-04-11 Takuo Matsuoka

First-order logic is known to have limited expressive power over finite structures. It enjoys in particular the locality property, which states that first-order formulae cannot have a global view of a structure. This limitation ensures on…

Logic in Computer Science · Computer Science 2009-04-14 Stephane Grumbach , Zhilin Wu