Theorem Proving for Prenex Gödel Logic With Delta: Checking Validity and Unsatisfiability

Logical Methods in Computer Science - Germany
doi 10.2168/lmcs-8(1:20)2012
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Logical Methods in Computer Science e.V.

Related search

Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Potential Synergies of Theorem Proving and Model Checking for Software Product Lines

2014English

Automated Theorem Proving by Translation to Description Logic

EasyChair Preprints
2018English

DNA Implementation of Theorem Proving With Resolution Refutation in Propositional Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Integrating Model Checking and Theorem Proving in a Reflective Functional Language

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Cryptographically Sound Theorem Proving

English

Tableau-Based Theorem Proving for Representation and Reasoning.

English

SMTtoTPTP – A Converter for Theorem Proving Formats

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Proof Simplification and Automated Theorem Proving

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
MathematicsEngineeringAstronomyPhysics
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy