Complete, Recursively Enumerable Relations in Arithmetic

DOI10.1002/MALQ.19950410107zbMath0827.03027OpenAlexW2039379005MaRDI QIDQ4323833

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

representationsPeano arithmeticprovability predicaterecursively enumerable relationsstrict partial orders

Mathematics Subject Classification ID

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

Related Items (1)

Fixed points and unfounded chains

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