\(T\)-theorem proving. I

DOI10.1006/jsco.1995.1053zbMath0851.68101OpenAlexW2075268055MaRDI QIDQ1914165

Jacob T. Schwartz, Alberto Policriti

Publication date: 4 June 1996

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1995.1053

zbMATH Keywords

decidabilityautomated theorem prover

Mathematics Subject Classification ID

Related Items

A set-theoretic translation method for polymodal logics ⋮ Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) ⋮ Combining Non-Stably Infinite Theories ⋮ Goals and benchmarks for automated map reasoning ⋮ Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators