Relations enumerable from positive information

DOI10.1093/LOGCOM/EXAF034MaRDI QIDQ6915751zbMATH OpenFDO

Authors Barbara Csima, Luke MacLean, Dino Rossegger

Publication date 15 October 2025

Published in Journal of Logic and Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAF034

zbMATH Keywords

enumeration reducibilitypositive definabilityr.i.p.e. relations

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Other infinitary logic (03C75) Theory of numerations, effectively presented structures (03D45) Computer science (68-XX)

Cites work

• A Jump Inversion Theorem for the Degree Spectra
• A Lopez-Escobar theorem for continuous domains
• A Note on ω-Jump Inversion of Degree Spectra of Structures
• Algorithmic reducibilities of algebraic structures
• Arithmetical Reducibilities I
• Computability and models. Perspectives east and west
• Computable functors and effective interpretability
• Computable Structure Theory
• Degrees coded in jumps of orderings
• Degrees of presentability of structures. I
• Effective model theory vs. recursive model theory
• Enumeration reducibility and computable structure theory
• Generic copies of countable structures
• scientific article; zbMATH DE number 2237373 (Why is no real title available?)
• Positive enumerable functors
• Rice sequences of relations
• Turing computable embeddings

This page was built for publication: Relations enumerable from positive information

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