English
Related papers

Related papers: Axiomatizing AECs and applications

200 papers

We study the \'etale sheafification of algebraic K-theory, called \'etale K-theory. Our main results show that \'etale K-theory is very close to a noncommutative invariant called Selmer K-theory, which is defined at the level of categories.…

K-Theory and Homology · Mathematics 2021-04-13 Dustin Clausen , Akhil Mathew

Suppose L is a relational language and P in L is a unary predicate. If M is an L-structure then P(M) is the L-structure formed as the substructure of M with domain {a: M models P(a)}. Now suppose T is a complete first order theory in L with…

Logic · Mathematics 2008-02-03 Bradd Hart , Saharon Shelah

We propose a proof of the downward L\"owenheim-Skolem that relies on strategies deriving from evaluation games instead of the Skolem normal forms. This proof is simpler, and easily understood by the students, although it requires, when…

Computers and Society · Computer Science 2015-07-15 Jacques Duparc

We tackle a fundamental problem in empirical game-theoretic analysis (EGTA), that of learning equilibria of simulation-based games. Such games cannot be described in analytical form; instead, a black-box simulator can be queried to obtain…

Computer Science and Game Theory · Computer Science 2019-06-03 Enrique Areyan Viqueira , Cyrus Cousins , Eli Upfal , Amy Greenwald

In this paper we introduce a new formalism for $K$-theory, called squares $K$-theory. This formalism allows us to simultaneously generalize the usual three-term relation $[B] = [A] + [C]$ for an exact sequence $A \hookrightarrow B…

K-Theory and Homology · Mathematics 2026-02-11 Jonathan Campbell , Josefien Kuijper , Mona Merling , Inna Zakharevich

The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful and decidable…

Logic in Computer Science · Computer Science 2023-08-30 Joshua Hirschbrunn , Yevgeny Kazakov

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

Logic · Mathematics 2015-12-15 Justin Brody

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…

Logic · Mathematics 2021-12-09 Rob Egrot

We show that the hermitian K-theory space of a commutative ring R can be identified, up to A^1-homotopy, with the group completion of the groupoid of oriented finite Gorenstein R-algebras, i.e., finite locally free R-algebras with…

Algebraic Geometry · Mathematics 2022-09-14 Marc Hoyois , Joachim Jelisiejew , Denis Nardin , Maria Yakerson

We work with a pre-$\lambda$-frame, which is an abstract elementary class (AEC) endowed with a collection of basic types and a non-forking relation satisfying certain natural properties with respect to models of cardinality $\lambda$. We…

Logic · Mathematics 2018-11-02 Ari Meir Brodsky , Adi Jarden

We propose a geometric setting of the axiomatic mathematical formalism of quantum theory. Guided by the idea that understanding the mathematical structures of these axioms is of similar importance as was historically the process of…

Mathematical Physics · Physics 2017-11-27 Wolfgang Bertram

The Kochen-Specker (KS) theorem is a cornerstone result in quantum foundations, establishing that quantum correlations in Hilbert spaces of dimension $d \geq 3$ cannot be explained by (consistent) hidden variable theories that assign a…

Quantum Physics · Physics 2024-10-16 Ravishankar Ramanathan

Theory of Mind benchmarks for large language models typically produce aggregate scores without theoretical grounding, making it unclear whether high performance reflects strategic reasoning or surface-level heuristics. We introduce a…

Computer Science and Game Theory · Computer Science 2026-03-12 Mateo Pechon-Elkins , Jon Chun

This paper explores the relationship between convexity and sum sets. In particular, we show that elementary number theoretical methods, principally the application of a squeezing principle, can be augmented with the Elekes-Szab\'{o} Theorem…

Combinatorics · Mathematics 2024-01-17 Oliver Roche-Newton , Elaine Wong

In this paper we consider the normal modal logics of elementary classes defined by first-order formulas of the form $\forall x_0 \exists x_1 \dots \exists x_n \bigwedge x_i R_\lambda x_j$. We prove that many properties of these logics, such…

Logic · Mathematics 2015-03-02 Stanislav Kikot

We prove a general congruence result for bisimilarity in higher-order languages, which generalises previous work to languages specified by a labelled transition system in which programs may occur as labels, and which may rely on operations…

Logic in Computer Science · Computer Science 2023-03-22 Tom Hirschowitz , Ambroise Lafont

We study first-order as well as infinitary logics extended with quantifiers closed upwards under embeddings. In particular, we show that if a chain of quasi-homogeneous structures is sufficiently long then a given formula of such a logic is…

Logic · Mathematics 2014-07-04 Jevgeni Haigora , Kerkko Luosto

Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…

Computer Science and Game Theory · Computer Science 2017-03-09 Daizhan Cheng , Ting Liu

We consider a generalization $K_0^{\operatorname{gr}}(R)$ of the standard Grothendieck group $K_0(R)$ of a graded ring $R$ with involution. If $\Gamma$ is an abelian group, we show that $K_0^{\operatorname{gr}}$ completely classifies graded…

Rings and Algebras · Mathematics 2020-04-08 Roozbeh Hazrat , Lia Vas

Game semantics aim at describing the interactive behaviour of proofs by interpreting formulas as games on which proofs induce strategies. In this article, we introduce a game semantics for a fragment of first order propositional logic. One…

Logic in Computer Science · Computer Science 2008-12-18 Samuel Mimram
‹ Prev 1 8 9 10 Next ›