Universality of Regular Realizability Problems

DOI10.1007/978-3-642-38536-0_24MaRDI QIDQ4928492zbMATH OpenOpenAlexFDO

Authors Mikhail Vyalyi

Publication date 14 June 2013

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38536-0_24

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On regular realizability problems
• On the universal realizability problem
• On expressive power of regular realizability problems
• On new universal realizability criteria
• Regularity properties of definable sets of reals
• Permutative universal realizability
• The completeness of provable realizability
• On the concept of relatively uniform realizability of propositional formulas
• Universality and almost decidability
• Realizability and recursive set theory

Cited in

(4)

• Regular Realizability Problems and Context-Free Languages
• On regular realizability problems for context-free languages
• On universality of regular realizability problems
• On expressive power of regular realizability problems

This page was built for publication: Universality of Regular Realizability Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928492)