1 citations · 2 across the 8 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2023
A note on Stone-Čech compactification in ZFA
Michał R. Przybyłek
Working in Zermelo-Fraenkel Set Theory with Atoms over an -categorical -stable structure, we show how \emph{infinite} constructions over definable sets can be encoded as \emp…
cs.LO2020
On amenability of constraint satisfaction problems
Michał R. Przybyłek
Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution…
cs.LO2020
Beyond sets with atoms: definability in first order logic
Michał R. Przybyłek
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to…