相关论文: A 2-Categorical Bridge Between Henkin Construction…

We establish a categorical framework relating two canonical model constructions in first-order logic: the Henkin construction and compactness-based constructions via ultraproducts or saturation. By introducing a globally fixed set of Henkin…

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…

This paper provides an overview of Lawvere's Fixed-Point Theorem in category theory and aims to detail the universal framework underlying self-reference and recursive structures. First, we rigorously define fundamental concepts - such as…

We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…

The aim of this paper is to study categorified algebraic structures and their pseudo- and lax homomorphisms using the framework of Lawvere $2$-theories, and more generally, (enhanced) $2$-dimensional sketches. The key notion we focus on is…

G{\"o}del's completeness theorem for classical first-order logic is one of the most basic theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula.We survey a…

This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…

Definite descriptions are first-order expressions that denote unique objects. In this paper, we propose a second-order counterpart, designed to refer to unique relations between objects. We investigate this notion within the framework of…

Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A…

We propose a new framework for integrating quantifiers with other logical connectives in a higher-categorical setting. Our method systematically incorporates key coherence conditions-including those akin to the Beck-Chevalley property-and…

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

We present a domain-specific type theory for constructions and proofs in category theory. The type theory axiomatizes notions of category, functor, profunctor and a generalized form of natural transformations. The type theory imposes an…

This article tackles categorical coherence within a two-dimensional generalization of Lawvere's functorial semantics. 2-theories, a syntactical way of describing categories with structure, are presented. From the perspective here afforded,…

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a…

Given 2-categories $\mathcal{C}$ and $\mathcal{D}$, let $\textrm{Lax}(\mathcal{C},\mathcal{D})$ denote the 2-category of lax functors, lax natural transformations and modifications, and $[\mathcal{C},\mathcal{D}]_\mathrm{lnt}$ its full…

As several different formal systems with inequivalent syntax may describe equivalent semantics, it is possible to find `completions' to more expressive syntaxes that are semantically invariant. Doctrine theory, in the sense of Lawvere, is…

Neural networks excel at pattern recognition but struggle with reliable logical reasoning, often violating basic logical principles during inference. We address this limitation by developing a categorical framework that systematically…

We develop a representation theory of categories as a means to explore characteristic structures in algebra. Characteristic structures play a critical role in isomorphism testing of groups and algebras, and their construction and…

We prove the (2,1)-categorical analogue of the small object argument and give a (2,1)-model structure on the category of small coherent categories, coherent functors and natural isomorphisms. It is induced by a higher dimensional example of…

`Categorification' is the process of replacing equations by isomorphisms. We describe some of the ways a thoroughgoing emphasis on categorification can simplify and unify mathematics. We begin with elementary arithmetic, where the category…