English
Related papers

Related papers: A 2-Categorical Bridge Between Henkin Construction…

200 papers

In a previous paper the authors have attached to each Dynkin quiver an associative algebra. The definition is categorical and the algebra is used to construct desingularizations of arbitrary quiver Grassmannians. In the present paper we…

Algebraic Geometry · Mathematics 2013-02-22 Giovanni Cerulli Irelli , Evgeny Feigin , Markus Reineke

This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…

Logic · Mathematics 2026-04-28 John T. Baldwin , Constantin C. Brîncuş

An explicit Lorentz covariant formulation of the canonical theory for classical fields is established on a space-like hypersurface. Hamilton's equations and a Poisson bracket are defined on the space-like hypersurface. The Poisson bracket…

High Energy Physics - Theory · Physics 2009-09-25 Hiroshi Ozaki

We develop a homotopy theory for additive categories endowed with endofunctors, analogous to the concept of a model structure. We use it to construct the homotopy theory of a Hovey triple (which consists of two compatible complete cotorsion…

Representation Theory · Mathematics 2017-03-09 Zhi-Wei Li

We give two examples of categorical axioms asserting that a canonically defined natural transformation is invertible where the invertibility of any natural transformation implies that the canonical one is invertible. The first example is…

Category Theory · Mathematics 2012-05-03 Stephen Lack

Brouwer's constructivist foundations of mathematics is based on an intuitively meaningful notion of computation shared by all mathematicians. Martin-L\"of's meaning explanations for constructive type theory define the concept of a type in…

Logic in Computer Science · Computer Science 2016-06-15 Carlo Angiuli , Robert Harper , Todd Wilson

We provide a Lawvere-style definition for partial theories, extending the classical notion of equational theory by allowing partially defined operations. As in the classical case, our definition is syntactic: we use an appropriate class of…

Logic in Computer Science · Computer Science 2020-11-16 Ivan Di Liberti , Fosco Loregian , Chad Nester , Paweł Sobociński

Given a symmetric monoidal $(\infty,2)$-category $\mathscr E$ we promote the trace construction to a functor. We then apply this formalism to the case when $\mathscr{E}$ is the $(\infty,2)$-category of $k$-linear presentable categories…

Algebraic Geometry · Mathematics 2019-11-13 Grigory Kondyrev , Artem Prikhodko

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

Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for…

Logic in Computer Science · Computer Science 2010-01-25 Mark Kaminski , Gert Smolka

We present a new multisymplectic framework for second-order classical field theories which is based on an extension of the unified Lagrangian-Hamiltonian formalism to these kinds of systems. This model provides a straightforward and simple…

Mathematical Physics · Physics 2015-06-08 Pedro D. Prieto-Martínez , Narciso Román-Roy

We develop a constructive theory of finite multisets in Homotopy Type Theory, defining them as free commutative monoids. After recalling basic structural properties of the free commutative-monoid construction, we formalise and establish the…

Logic in Computer Science · Computer Science 2023-06-22 Vikraman Choudhury , Marcelo Fiore

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser

Central to the theory of special cube complexes is Haglund and Wise's construction of the canonical completion and retraction, which enables one to build finite covers of special cube complexes in a highly controlled manner. In this paper…

Group Theory · Mathematics 2022-08-10 Sam Shepherd

We prove the algorithmic canonicity of two classes of $\mu$-inequalities in a constructive meta-theory of normal lattice expansions. This result simultaneously generalizes Conradie and Craig's canonicity for $\mu$-inequalities based on a…

Logic · Mathematics 2016-03-22 Willem Conradie , Andrew Craig , Alessandra Palmigiano , Zhiguang Zhao

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

We introduce a systematic mathematical language for describing fixed point models and apply it to the study to topological phases of matter. The framework is reminiscent of state-sum models and lattice topological quantum field theories,…

Quantum Physics · Physics 2022-07-28 A. Bauer , J. Eisert , C. Wille

We prove the conjectured classification of topological phases in two spatial dimensions with gappable boundary, in a simplified setting. Two gapped ground states of lattice Hamiltonians are in the same quantum phase of matter, or…

Quantum Physics · Physics 2024-05-28 Isaac H. Kim , Daniel Ranard

In this paper we provide a semantic and syntactic analysis of parametrised natural numbers object in coherent categories, or pr-coherent categories. Semantically, we show the definable functions in the initial pr-coherent category are…

Logic · Mathematics 2026-02-17 Lingyuan Ye

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order…

Computational Complexity · Computer Science 2007-05-23 Joerg Flum , Martin Grohe
‹ Prev 1 8 9 10 Next ›