Complete, Recursively Enumerable Relations in Arithmetic

DOI10.1002/MALQ.19950410107MaRDI QIDQ4323833zbMATH OpenOpenAlexFDO

Authors Giovanna D'Agostino, Mario Magnago

Publication date 20 February 1995

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19950410107

zbMATH Keywords

Peano arithmeticprovability predicaterecursively enumerable relationsrepresentationsstrict partial orders

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Theory of numerations, effectively presented structures (03D45) First-order arithmetic and fragments (03F30)

Recommendations

• Recursively Enumerable Images of Arithmetic Sets
• scientific article; zbMATH DE number 4035808
• Expressibility in the elementary theory of recursively enumerable sets with realizability logic
• \(\Sigma^ n_ 0\)-equivalence relations
• Recursively Enumerable Equivalence Relations Modulo Finite Differences

Cited in

(9)

• Expressibility in the elementary theory of recursively enumerable sets with realizability logic
• Partially generic formulas in arithmetic
• Recursively Enumerable Images of Arithmetic Sets
• scientific article; zbMATH DE number 4035808 (Why is no real title available?)
• scientific article; zbMATH DE number 1841839 (Why is no real title available?)
• Recursive functions and existentially closed structures
• Array nonrecursiveness and relative recursive enumerability
• Fixed points and unfounded chains
• On the relationships between some meta-mathematical properties of arithmetical theories

This page was built for publication: Complete, Recursively Enumerable Relations in Arithmetic

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