scientific article; zbMATH DE number 7147443

MaRDI QIDQ5207051

Szymon Toruńczyk, Sławomir Lasota, Joanna Ochremiak, Bartek Klin, Khadijeh Keshvardoost

Publication date: 3 January 2020

Full work available at URL: https://arxiv.org/abs/1802.08500

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

isomorphism problemdefinable sets\(\omega\)-categoricity

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Interpolation, preservation, definability (03C40) Model theory of denumerable and separable structures (03C15) Categoricity and completeness of theories (03C35)

Uses Software

• LOIS
• NLambda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Nominal Sets
• Automata theory in nominal sets
• Towards nominal computation
• Äquivalenzklassen von n‐Tupeln
• Turing machines with atoms, constraint satisfaction problems, and descriptive complexity
• Locally Finite Constraint Satisfaction Problems
• Turing Machines with Atoms
• Graph isomorphism in quasipolynomial time [extended abstract]
• LOIS: syntax and semantics

This page was built for publication: