English
Related papers

Related papers: A New Construction Principle

200 papers

Fixed points are a recurring theme in computer science and are often constructed as limits of suitably seeded fixed point iterations. We present the algebra of iterative constructions (AIC) -- a purely algebraic approach to reasoning about…

Logic in Computer Science · Computer Science 2026-05-14 Kevin Batz , Benjamin Lucien Kaminski , Lucas Kehrer , Gerwin Klein , Todd Schmid , Henning Urbat

In [11] Sklinos proved that any uncountable free group is not $\aleph_1$-homogenenous. This was later generalized by Belegradek in [1] to torsion-free residually finite relatively free groups, leaving open whether the assumption of residual…

Logic · Mathematics 2025-02-12 Davide Carolillo , Gianluca Paolini

We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…

Logic · Mathematics 2019-05-10 Will Boney , Sebastien Vasey

We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…

Logic · Mathematics 2013-09-27 Benno van den Berg , Ieke Moerdijk

New features of a previously introduced Group Approach to Quantization are presented. We show that the construction of the symmetry group associated with the system to be quantized (the "quantizing group") does not require, in general, the…

High Energy Physics - Theory · Physics 2009-10-28 M. Navarro , V. Aldaya , M. Calixto

We investigate the local topological structure of non-metrizable topological groups through the lens of Tukey order and cofinal types. Motivated by recent advances in topological groups admitting an $\omega^\omega$-base, we introduce the…

General Topology · Mathematics 2026-05-26 Xuan Gong , Dekui Peng

We introduce the framework of AECats (abstract elementary categories), generalising both the category of models of some first-order theory and the category of subsets of models. Any AEC and any compact abstract theory ("cat", as introduced…

Logic · Mathematics 2023-03-24 Mark Kamsma

We use $\diamondsuit$ to construct, for every $\alpha\leq\omega_1$ a sequential countably compact topological group of sequential order $\alpha$. This establishes the independence of the existence of sequential countably compact non…

General Topology · Mathematics 2019-03-20 Dmitri Shakhmatov , Alexander Shibakov

We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's…

Logic in Computer Science · Computer Science 2015-07-01 Gyesik Lee , Benjamin Werner

We prove: $\mathbf{Theorem}$ Let $K$ be a universal class. If $K$ is categorical in cardinals of arbitrarily high cofinality, then $K$ is categorical on a tail of cardinals. The proof stems from ideas of Adi Jarden and Will Boney, and also…

Logic · Mathematics 2017-06-12 Sebastien Vasey

Mekler's construction is a powerful technique for building purely algebraic structures from combinatorial ones. Its power lies in the fact that it allows various model-theoretic tameness properties of the combinatorial structure to transfer…

Logic · Mathematics 2026-03-25 Blaise Boissonneau , Aris Papadopoulos , Pierre Touchard

In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…

Logic · Mathematics 2024-06-10 Jorge Antonio Cruz Chapital

We introduce a new categorical and constructive foundation for analytic approximation based on a Contextual Choice Principle (CCP), which enforces locality and compatibility in the construction of mathematical objects. Central to our…

Functional Analysis · Mathematics 2025-07-22 Andreu Ballus Santacana

We introduce a minimal ZFC-internal axiom system for pre-structural data (X, A, mu, mu^{otimes 2}, R, I, Pi_R, G, E_0, eta), where Pi_R : X -> R is a designated map and G subset X x X is a measurable relation; admissible structural models…

General Mathematics · Mathematics 2026-04-22 Yunbeom Yi

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

We apply, in the context of semigroups, the main theorem from~\cite{higjac} that an elementary class $\mathcal{C}$ of algebras which is closed under the taking of direct products and homomorphic images is defined by systems of equations. We…

Logic · Mathematics 2023-08-25 Peter M. Higgins , Marcel Jackson

The goal of this paper is to generalise Alex Rennet's proof of the non-axiomatizability of the class of pseudo-o-minimal structures. Rennet showed that if L is an expansion of the language of ordered fields and K is the class of…

Logic · Mathematics 2019-02-21 Peter Sinclair

Mekler's construction gives an interpretation of any structure in a finite relational language in a group (nilpotent of class $2$ and exponent $p>2$, but not finitely generated in general). Even though this construction is not a…

Logic · Mathematics 2018-07-10 Artem Chernikov , Nadja Hempel

Let $\text{Ch}$ be the category of (possibly unbounded) chain complexes of abelian groups. In this note we construct the standard Quillen model structure on $\text{Ch}$, by a method that is somewhat different from the standard one.…

Algebraic Topology · Mathematics 2020-01-27 Neil Strickland

Assume ZF (without the Axiom of Choice). Let $j:V_\varepsilon\to V_\delta$ be a non-trivial $\in$-cofinal $\Sigma_1$-elementary embedding, where $\varepsilon,\delta$ are limit ordinals. We prove some restrictions on the constructibility of…

Logic · Mathematics 2020-12-21 Farmer Schlutzenberg