Cover Image

Random expansions of trees with bounded height

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Koponen, Vera, Tousinejad, Yasmin
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science 03C13, 03C80, 03C98, 03B42, 03B70, 68T27, 68T30 F.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Random expansions of finite structures with bounded degree
by: Koponen, Vera
Published: (2024)

On the expressive power of inquisitive epistemic logic
by: Ciardelli, Ivano, et al.
Published: (2023)

A general approach to asymptotic elimination of aggregation functions and generalized quantifiers
by: Koponen, Vera, et al.
Published: (2023)

A convergence law for continuous logic and continuous structures with finite domains
by: Koponen, Vera
Published: (2025)

Hierarchies of direct powers, ultrapowers and cumulative powers
by: Yago, Pedro Teixeira
Published: (2026)

Two strong undefinability results in inquisitive and team semantics
by: Barbero, Fausto
Published: (2024)

Normalization properties of $λμ$-calculus using realizability semantics
by: Battyanyi, Peter, et al.
Published: (2023)

On the relative asymptotic expressivity of inference frameworks
by: Koponen, Vera, et al.
Published: (2022)

Preservation theorems on sparse classes revisited
by: Dawar, Anuj, et al.
Published: (2024)

Black Box Deployed -- Functional Criteria for Artificial Moral Agents in the LLM Era
by: Brophy, Matthew E.
Published: (2025)

Decidability of the theory of modules over Prüfer domains with infinite residue fields
by: Gregory, Lorna, et al.
Published: (2017)

Decidability of the theory of modules over Prüfer domains with dense value groups
by: Gregory, Lorna, et al.
Published: (2019)

More conservativity for weak Kőnig's lemma
by: Freund, Anton, et al.
Published: (2024)

Nested Sequents for Intuitionistic Multi-Modal Logics: Modularity, Cut-Elimination, and Undecidability
by: Lyon, Tim S.
Published: (2025)

Domain size asymptotics for Markov logic networks
by: Koponen, Vera
Published: (2025)

Automorphisms of the Rado meet-tree
by: Kaplan, Itay, et al.
Published: (2023)

Quantitative Linear Logic
by: Capucci, Matteo, et al.
Published: (2026)

Dependent Types Simplified
by: Bice, Tristan
Published: (2025)

Notions of rank and independence in countably categorical theories
by: Koponen, Vera
Published: (2025)

Decidability for the theory of modules over a Prüfer domain
by: Gregory, Lorna
Published: (2021)

A propositional cirquent calculus for computability logic
by: Japaridze, Giorgi
Published: (2024)

Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics
by: Japaridze, Giorgi
Published: (2026)

Hereditary First-Order Logic: the tractable quantifier prefix classes
by: Bodirsky, Manuel, et al.
Published: (2024)

On the Computational Power of Extensional ESO
by: Bodirsky, Manuel, et al.
Published: (2025)

Adding an Implication to Logics of Perfect Paradefinite Algebras
by: Greati, Vitor, et al.
Published: (2023)

Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)

A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory
by: Bodirsky, Manuel, et al.
Published: (2020)

A Reflection Principle for Potential Infinite Models of Type Theory
by: Eberl, Matthias
Published: (2024)

Local stability in structures with a standard sort
by: Barbina, Silvia, et al.
Published: (2025)

Logical Modalities within the European AI Act: An Analysis
by: Lawniczak, Lara, et al.
Published: (2025)

Some contributions to presheaf model theory
by: Brunner, Andreas, et al.
Published: (2024)

Computing Distinguishing Formulae for Threshold-Based Behavioural Distances
by: Forster, Jonas, et al.
Published: (2026)

Why the classes P and NP are not well-defined finitarily
by: Anand, Bhupinder Singh
Published: (2024)

Remarks on Primitive Regulation
by: Rosko, Milan
Published: (2026)

Logic families
by: Andréka, H., et al.
Published: (2023)

Quite Complete Real Closed fields
by: Shelah, Saharon
Published: (2001)

Uniform Interpolation
by: van Gool, Sam
Published: (2025)

Formally Verifying a Transformation from MLTL Formulas to Regular Expressions
by: Wang, Zili, et al.
Published: (2025)

Formalizing MLTL Formula Progression in Isabelle/HOL
by: Kosaian, Katherine, et al.
Published: (2024)

Complexity of deep computations via topology of function spaces
by: Dueñez, Eduardo, et al.
Published: (2026)