Rules and Refutation Rules for the Logic of Finite n-ary Trees

DOI10.1093/LOGCOM/14.3.429zbMath1062.03018OpenAlexW2008915117MaRDI QIDQ4820475

Tom Skura

Publication date: 15 October 2004

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/14.3.429

zbMATH Keywords

decidabilityintermediate logicsfinite treesrefutation rules

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Decidability of theories and sets of sentences (03B25) Intermediate logics (03B55)

Related Items (1)

Intuitionistic Socratic procedures

This page was built for publication: Rules and Refutation Rules for the Logic of Finite n-ary Trees