English
Related papers

Related papers: How to take cats together

200 papers

Canonical extension has proven to be a powerful tool in algebraic study of propositional logics. In this paper we describe a generalization of the theory of canonical extension to the setting of first order logic. We define a notion of…

Category Theory · Mathematics 2012-07-05 Dion Coumans

A central area of current philosophical debate in the foundations of mathematics concerns whether or not there is a single, maximal, universe of set theory. Universists maintain that there is such a universe, while Multiversists argue that…

Logic · Mathematics 2023-06-22 Carolin Antos , Neil Barton , Sy-David Friedman

We generalize the dual notions of "expansion" and "collapse" so they can be applied to arbitrary metric spaces. We also expand the theory to allow for infinitely many such moves. Those tools are then employed to prove a variety of…

Geometric Topology · Mathematics 2023-11-07 Craig R. Guilbault , Daniel Gulbrandsen

Given a small category C, we show that there is a universal way of expanding C into a model category, essentially by formally adjoining homotopy colimits. The technique of localization becomes a method for imposing `relations' into these…

Algebraic Topology · Mathematics 2007-05-23 Daniel Dugger

We consider a set-theoretic version of mereology based on the inclusion relation $\subseteq$ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of $\in$ from $\subseteq$, we identify…

Logic · Mathematics 2016-04-27 Joel David Hamkins , Makoto Kikuchi

The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…

General Topology · Mathematics 2008-02-28 Jerzy Dydak

Basing ourselves on Janelidze and Kelly's general notion of central extension, we study universal central extensions in the context of semi-abelian categories. Thus we unify classical, recent and new results in one conceptual framework. The…

Algebraic Topology · Mathematics 2012-10-12 Jose Manuel Casas , Tim Van der Linden

\textit{Mereological fusion}, also known as \textit{composition} and \textit{sum}, was originally used by me as a primitive notion to axiomatize \textit{Extensional Mereology} wih \textit{atoms} in \cite{Ly22}. Here, I extend this idea to…

Logic · Mathematics 2023-12-27 Marcin Łyczak

We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…

Logic in Computer Science · Computer Science 2019-01-11 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

A certain amount of category theory is developed in an arbitrary finitely complete category with a factorization system on it, playing the role of the comprehensive factorization system on Cat. Those aspects related to the concepts of…

Category Theory · Mathematics 2007-09-07 Claudio Pisani

This paper develops a categorical framework to clarify the relationship between the completeness and compactness theorems in classical first-order logic. Rather than claiming that different model constructions yield naturally isomorphic…

General Mathematics · Mathematics 2025-10-23 Joaquim Reizi Barreto

Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to admit a model completion, extending a characterization provided by Wheeler. For varieties of algebras…

Logic · Mathematics 2022-01-05 George Metcalfe , Luca Reggio

The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…

Logic · Mathematics 2017-04-17 Joel David Hamkins , Makoto Kikuchi

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko

We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A…

Logic · Mathematics 2020-09-22 Joel David Hamkins , Wojciech Aleksander Wołoszyn

Category theory gives a mathematical characterization of naturality but not of canonicity. The purpose of this paper is to develop the logical theory of canonical maps based on the broader demonstration that the dual notions of elements &…

Category Theory · Mathematics 2024-10-07 David Ellerman

Mereology is the study of parts and the relationships that hold between them. We introduce a behavioral approach to mereology, in which systems and their parts are known only by the types of behavior they can exhibit. Our discussion is…

Logic · Mathematics 2020-07-06 Brendan Fong , David Jaz Myers , David I. Spivak

Canonical extension of finitary ordered structures such as lattices, posets, proximity lattices, etc., is a certain completion which entirely describes the topological dual of the ordered structure and it does so in a purely algebraic and…

Category Theory · Mathematics 2022-05-12 Tomáš Jakl

Mereology is the study of parts and the relationships that hold between them. We introduce a behavioral approach to mereology, in which systems and their parts are known only by the types of behavior they can exhibit. Our discussion is…

Logic in Computer Science · Computer Science 2021-01-27 Brendan Fong , David Jaz Myers , David I. Spivak

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner
‹ Prev 1 2 3 10 Next ›