Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Generalizations of enumeration reducibility using recursive infinitary propositional sentences

From MaRDI portal
Publication:1207542
Jump to:navigation, search

DOI10.1016/0168-0072(92)90026-VzbMath0769.03025OpenAlexW2038095589MaRDI QIDQ1207542

C. J. Ash

Publication date: 1 April 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(92)90026-v


zbMATH Keywords

infinitary propositional logicenumeration reducibility


Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)


Related Items (4)

The jump operation for structure degrees ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures ⋮ Regular enumerations




Cites Work

  • Unnamed Item
  • Generic copies of countable structures
  • Maximal Arithmetical Reducibilities
  • Arithmetical Reducibilities II




This page was built for publication: Generalizations of enumeration reducibility using recursive infinitary propositional sentences

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1207542&oldid=13271993"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 06:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki