The theory of computability developed in terms of satisfaction

DOI10.1305/NDJFL/1012429716zbMATH Open0989.03043OpenAlexW2000580495MaRDI QIDQ1347606

V. Pereyra

Publication date: 29 April 2002

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1012429716

zbMATH Keywords

satisfactioncomputabilitytheory of truth

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Gödel numberings and issues of incompleteness (03F40) Abstract and axiomatic computability and recursion theory (03D75)

This page was built for publication: The theory of computability developed in terms of satisfaction

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