On the Gentzen Type Formalizations

DOI10.1002/MALQ.19800262803zbMath0471.03021OpenAlexW2101860627MaRDI QIDQ3924173

Anita Wasilewska

Publication date: 1980

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

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

zbMATH Keywords

decidabilityrecursive relationscontext-free grammarrelational systemspredicate calculiGentzen type formalizations of propositional calculisyntactical decidability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) General logic (03B99)

Related Items (4)

Meeting of the Association for Symbolic Logic, Madison, 1982 ⋮ European Summer Meeting of the Association for Symbolic Logic ⋮ Programs and logics ⋮ DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations

This page was built for publication: On the Gentzen Type Formalizations