1 citations · 2 across the 8 of their papers we have counts for
8 papers
Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
Michał R. Przybyłek, Paweł Siedlecki
The authors of ``A note on the complexity of a phaseless polynomial interpolation'' have shown that phaseless polynomial interpolation over is possible with poin…
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…
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…
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…
A note on the complexity of a phaseless polynomial interpolation
Michal R. Przybylek, Pawel Siedlecki
In this paper we revisit the classical problem of polynomial interpolation, with a slight twist; namely, polynomial evaluations are available up to a group action of the unit circl…
Logical systems II: Free semantics
Michal R. Przybylek
This paper is a sequel to "Logical systems I: Lambda calculi through discreteness". It provides a general 2-categorical setting for extensional calculi and shows how intensional an…
The other pullback lemma
Michal R. Przybylek
Given a composition of two commutative squares, one well-known pullback lemma says that if both squares are pullbacks, then their composition is also a pullback; another well-known…
Logical systems I: Lambda calculi through discreteness
Michal R. Przybylek
This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theor…