English
Related papers

Related papers: Cofinality quantifiers in Abstract Elementary Clas…

200 papers

A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…

Logic · Mathematics 2026-01-06 Maciej Malicki

This article contains ideas and their elaboration for quantifiers, which appeared after checking in practice the experimental language of the formal knowledge representation YAFOLL [1]: - looking at for_all and exists quantifiers as…

Logic in Computer Science · Computer Science 2019-08-30 Alex Shkotin

Some cohomology elements, called $\nu$ classes, as a supergeneralization of universal Chern classes, are introduced for canonical super line bundles over $\nu$ projective spaces, a novel supergeometric generalization of projective spaces.…

Differential Geometry · Mathematics 2020-11-10 Marzieh Roshandelbana , Saad Varsaie

We show that a number of results on abstract elementary classes (AECs) hold in accessible categories with concrete directed colimits. In particular, we prove a generalization of a recent result of Boney on tameness under a large cardinal…

Logic · Mathematics 2014-11-25 Michael Lieberman , Jirí Rosický

The third author has shown that Shelah's eventual categoricity conjecture holds in universal classes: class of structures closed under isomorphisms, substructures, and unions of chains. We extend this result to the framework of…

Logic · Mathematics 2019-05-20 Nathanael Ackerman , Will Boney , Sebastien Vasey

Let C subset Reg be a non-empty class (of regular cardinal). Then the logic L(Q^{cf}_C) has additional nice properties: it has homogeneous model existence property.

Logic · Mathematics 2009-02-04 Saharon Shelah

In this paper we examine the task set forth by Shelah and Villaveces in \cite{ShVi} of proving the uniqueness of limit models of cardinality $\mu$ in $\lambda$-categorical abstract elementary classes with no maximal models, where $\lambda$…

Logic · Mathematics 2016-12-02 Monica M. VanDieren

In this work, we fill the gap between the elementary quotient completion introduced by Maietti and Rosolini and the exact completion of a category with weak finite limits, as described by Carboni and Vitale. To achieve this, we generalize…

Category Theory · Mathematics 2025-05-07 Cipriano Junior Cioffo

For a fixed natural number $n \geq 1$, the Hart-Shelah example is an abstract elementary class (AEC) with amalgamation that is categorical exactly in the infinite cardinals less than or equal to $\aleph_n$. We investigate recently-isolated…

Logic · Mathematics 2018-07-26 Will Boney , Sebastien Vasey

We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

Logic in Computer Science · Computer Science 2017-07-19 Thomas Place , Marc Zeitoun

We give a presentation theorem for continuous first-order logic and Metric Abstract Elementary classes in terms of $L_{\omega_1, \omega}$ and Abstract Elementary Classes, respectively. This presentation is accomplished by analyzing dense…

Logic · Mathematics 2016-09-14 Will Boney

The purpose of this note is to provide exposition for a proof of the statement in the title. This idea, that arbitrary cohomology classes (of high enough degree) of a finite group $G$ can be trivialized in a finite group extension, has been…

Group Theory · Mathematics 2026-01-09 Adrien DeLazzer Meunier

The introduction of first-class type classes in the Coq system calls for re-examination of the basic interfaces used for mathematical formalization in type theory. We present a new set of type classes for mathematics and take full advantage…

Logic in Computer Science · Computer Science 2011-02-08 Bas Spitters , Eelis van der Weegen

We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{\omega_1,\omega}$. Theorem: Let $T$ be any complete first-order theory in a countable language…

Logic · Mathematics 2015-03-03 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

In this paper, we obtain two extension theorems for cohomology classes and holomorphic sections defined on analytic subvarieties, which are defined as the supports of the quotient sheaves of multiplier ideal sheaves of…

Complex Variables · Mathematics 2019-09-20 Xiangyu Zhou , Langfeng Zhu

Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…

Logic in Computer Science · Computer Science 2007-05-23 Stefan Ratschan

We introduce and study a new class of differential fields in positive characteristic. We call them separably differentially closed fields and demonstrate that they are the differential analogue of separably closed fields. We prove several…

Logic · Mathematics 2025-07-11 Kai Ino , Omar Leon Sanchez

Causal models defined in terms of a collection of equations, as defined by Pearl, are axiomatized here. Axiomatizations are provided for three successively more general classes of causal models: (1) the class of recursive theories (those…

Artificial Intelligence · Computer Science 2014-08-08 Joseph Y. Halpern

We streamline Malliaris and Shelah's proof that $\mathfrak{p} = \mathfrak{t}$. In particular, we replace cofinality spectrum problems with models of $ZFC^-$, and we eliminate the use of peculiar cuts.

Logic · Mathematics 2018-10-23 Douglas Ulrich

Causal models defined in terms of a collection of equations, as defined by Pearl, are axiomatized here. Axiomatizations are provided for three successively more general classes of causal models: (1) the class of recursive theories (those…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern