Skolemization in unranked logics

MaRDI QIDQ3122078zbMATH OpenFDO

Authors Lia Kurtanidze, Mikheil Rukhaia

Publication date 20 March 2019

Full work available at URL http://www.emis.de/journals/TICMI/vol22_1/p3-10.pdf, http://www.viam.science.tsu.ge/others/ticmi/blt/vol22_1/p3-10.pdf

zbMATH Keywords

normal formsproof complexitySkolemizationunranked logics

Mathematics Subject Classification ID

Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Logic in artificial intelligence (68T27) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• A note on assumptions about Skolem functions
• Skolemization for Substructural Logics
• scientific article; zbMATH DE number 4037813
• Skolemization modulo theories
• Efficient Skolemization

Cited in

(7)

• A note on assumptions about Skolem functions
• The Skolemization of existential quantifiers in intuitionistic logic
• Skolemization modulo theories
• Eskolemization in intuitionistic logic
• Skolemization for Substructural Logics
• scientific article; zbMATH DE number 4037813 (Why is no real title available?)
• Efficient Skolemization

Describes a project that uses

Uses Software

• CLP(Flex)
• Theorema
• Veriflog
• XCentric

This page was built for publication: Skolemization in unranked logics

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