Requirement systems

DOI10.2307/2275519zbMATH Open0835.03009OpenAlexW2911631747MaRDI QIDQ4836053FDOQ4836053

Authors: J. F. Knight 

Publication date: 3 July 1995

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275519

Recommendations

• Mixed systems
• Solovay's theorem cannot be simplified
• PRIORITY ARGUMENTS VIA TRUE STAGES
• Constructions by transfinitely many workers
• Labelling systems and r.e. structures

zbMATH Keywords

metatheoremspriority argumentsmodels of Peano Arithmeticinductive worker

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Models of arithmetic and set theory (03C62)

Cites Work

• Title not available (Why is that?)
• A construction for recursive linear orderings
• Pairs of recursive structures
• Labelling systems and r.e. structures
• Stability of recursive structures in arithmetical degrees

Cited In (4)

• Mixed systems
• Constructions by transfinitely many workers
• Labelling systems and r.e. structures
• A metatheorem for constructions by finitely many workers

This page was built for publication: Requirement systems

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