Cover Image

Constraint satisfaction problems, compactness and non-measurable sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Tardif, Claude
Format:	Preprint
Published:	2025
Subjects:	Logic Logic in Computer Science 03E65, 68Q19 G.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The complexity of being monitorable
by: Camerlo, Riccardo, et al.
Published: (2026)

There is a deep 1-generic set
by: Li, Ang
Published: (2024)

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

Deciding subspace reachability problems with application to Skolem's Problem
by: Everett, Samuel
Published: (2024)

Uniformity in learning structures
by: Cipriani, Vittorio, et al.
Published: (2025)

Classifying different criteria for learning algebraic structures
by: Bazhenov, Nikolay, et al.
Published: (2024)

Universal Gluing and Contextual Choice: Categorical Logic and the Foundations of Analytic Approximation
by: Santacana, Andreu Ballus
Published: (2025)

Description Complexity of Unary Structures in First-Order Logic with Links to Entropy
by: Jaakkola, Reijo, et al.
Published: (2024)

Algebraic Proof Theory for Infinitary Action Logic
by: Fussner, Wesley, et al.
Published: (2025)

The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
by: Kátay, Tamás, et al.
Published: (2023)

Refutability as Recursive as Provability
by: Cattabriga, Paola
Published: (2024)

The Syllogistic with Unity
by: Pratt-Hartmann, Ian
Published: (2011)

Game Comonads & Generalised Quantifiers
by: Conghaile, Adam Ó, et al.
Published: (2020)

Relative consistency of Set Matrix Theory with ZF
by: Cabbolet, Marcoen J. T. F.
Published: (2024)

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
by: Marković, Petar, et al.
Published: (2026)

An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees
by: Samra, Jean Abou, et al.
Published: (2026)

On the learning power of Friedman-Stanley jumps
by: Cipriani, Vittorio, et al.
Published: (2025)

Learning Equivalence Relations on Polish Spaces
by: Rossegger, Dino, et al.
Published: (2024)

Rough sets semantics for the three-valued extension of first-order Priest's da Costa logic
by: Castiglioni, José Luis, et al.
Published: (2025)

Provability in BI's Sequent Calculus is Decidable
by: Gheorghiu, Alexander, et al.
Published: (2021)

Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)

Descriptive complexity for neural networks via Boolean networks
by: Ahvonen, Veeti, et al.
Published: (2023)

Hyperfiniteness on Topological Ramsey Spaces
by: Bursics, Balázs, et al.
Published: (2024)

Choiceless Polynomial Space
by: Ferrarotti, Flavio, et al.
Published: (2024)

Matching logic -- a new axiomatization
by: Leuştean, Laurenţiu, et al.
Published: (2025)

Arithmetics within the Linear Time Hierarchy
by: Pollett, Chris
Published: (2025)

Notes on applicative matching logic
by: Leuştean, Laurenţiu
Published: (2025)

The equational theory of the Weihrauch lattice with (iterated) composition
by: Pradic, Cécilia
Published: (2024)

The equational theory of the Weihrauch lattice with multiplication
by: Neumann, Eike, et al.
Published: (2024)

Reflection in second-order set theory with abundant urelements bi-interprets a supercompact cardinal
by: Hamkins, Joel David, et al.
Published: (2022)

On the incomputability of computable dimension
by: Staiger, Ludwig
Published: (2019)

Foundational Analysis Of The Solvability Complexity Index: The Weihrauch-SCI Intermediate Hierarchy
by: Sorg, Christopher
Published: (2026)

Behavioural Theory of Reflective Algorithms II: Reflective Parallel Algorithms
by: Schewe, Klaus-Dieter, et al.
Published: (2025)

Semantics, Specification Logic, and Hoare Logic of Exact Real Computation
by: Park, Sewon, et al.
Published: (2016)

Fragments of Martin's axiom
by: Peng, Yinhe
Published: (2025)

Guessing genericity -- looking at parametrized diamonds from a different perspective
by: Kostana, Ziemowit
Published: (2023)

Reversible computations are computations
by: Aubert, Clément, et al.
Published: (2025)

Variants of Solovay reducibility
by: Titov, Ivan
Published: (2024)

Proxy principles in combinatorial set theory
by: Brodsky, Ari Meir, et al.
Published: (2024)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)