Alex Kruckman

dblp:120/7615 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
YearPublicationVenuePosition
2021 Tameness in least fixed-point logic and McColm's conjecture
Siddharth Bhaskar, Alex Kruckman
Log. Methods Comput. Sci.2
2020 Logics for Sizes with Union or Intersection
Caleb Kisby, Saúl A. Blanco, Alex Kruckman, Lawrence S. Moss
AAAI3
2019 Independence in Generic incidence Structures
abstract
Abstract We study the theory T m,n of existentially closed incidence structures omitting the complete incidence structure K m,n , which can also be viewed as existentially closed K m,n -free bipartite graphs. In the case m = n = 2, this is the theory of existentially closed projective planes. We give an $\forall \exists$ -axiomatization of T m,n , show that T m,n does not have a countable saturated model when m , n ≥ 2, and show that the existence of a prime model for T 2,2 is equivalent to a longstanding open question about finite projective planes. Finally, we analyze model theoretic notions of complexity for T m,n . We show that T m,n is NSOP 1 , but not simple when m , n ≥ 2, and we show that T m,n has weak elimination of imaginaries but not full elimination of imaginaries. These results rely on combinatorial characterizations of various notions of independence, including algebraic independence, Kim independence, and forking independence.
Gabriel Conant, Alex Kruckman
J. Symb. Log.2
2018 Generic expansion and Skolemization in NSOP1 theories
Alex Kruckman, Nicholas Ramsey
Ann. Pure Appl. Log.1