Expressive completeness and decidability

DOI10.1305/NDJFL/1093635592zbMath0726.03002OpenAlexW2080002446MaRDI QIDQ2277437

Stewart Shapiro, George F. Schumm

Publication date: 1990

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

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

zbMATH Keywords

expressive completeness of sets of two-valued truth functional connectionstruth-table conditionsTuring representation of truth- functional connectives

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Classical propositional logic (03B05)

This page was built for publication: Expressive completeness and decidability