Arithmetic with satisfaction

DOI10.1305/NDJFL/1040248460zbMATH Open0837.03044OpenAlexW2097741541MaRDI QIDQ1903591FDOQ1903591

Authors: Yanyan Li 

Publication date: 29 January 1996

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

Full work available at URL: https://semanticscholar.org/paper/d1deeda0938879a8b64dd3072f3c2140bbd438e8

Recommendations

• The theory of computability developed in terms of satisfaction
• Undefinability vs. definability of satisfaction and truth
• Syntactical truth predicates for second order arithmetic
• Publication:4204151
• Publication:4943159

zbMATH Keywords

satisfaction predicate

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Cites Work

• Title not available (Why is that?)
• Outline of a Theory of Truth

Cited In (4)

• Satisfying predicates: Kleene's proof of the Hilbert-Bernays theorem
• Here and There with Arithmetic
• Syntactical truth predicates for formulas with atomic negation
• The theory of computability developed in terms of satisfaction

This page was built for publication: Arithmetic with satisfaction

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