72 citations · 368 across the 79 of their papers we have counts for
Showing 2010 · math.LOShow all
2 papers · 2 filters
math.LO2010★ 1 cited
Decidability of definability
Manuel Bodirsky, Michael Pinsker, Todor Tsankov
For a fixed countably infinite structure Γ with finite relational signature τ, we study the following computational problem: input are quantifier-free τ-formulas ϕ_0,ϕ_1,...,ϕ_n th…
math.LO2010
Minimal functions on the random graph
Manuel Bodirsky, Michael Pinsker
We show that there is a system of 14 non-trivial finitary functions on the random graph with the following properties: Any non-trivial function on the random graph generates one of…