Results 231 to 240 of about 44,803 (280)

Conflict detection with invalid inferences: All heuristics, no logic. [PDF]

Mem Cognit
Kosourikhina V, Handley SJ.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Theories of the Classical Propositional Logic and Substitutions

Mathematical Notes, 2021
openaire   +3 more sources

PEIRCE’S CALCULI FOR CLASSICAL PROPOSITIONAL LOGIC

The Review of Symbolic Logic, 2018
AbstractThis article investigates Charles Peirce’s development of logical calculi for classical propositional logic in 1880–1896. Peirce’s 1880 work on the algebra of logic resulted in a successful calculus for Boolean algebra. This calculus, denoted byPC, is here presented as a sequent calculus and not as a natural deduction system.
Ma, Minghui, Pietarinen, Ahti-Veikko
openaire   +2 more sources

Classical Propositional Logic

2001
Abstract Classical propositional logic has associated with it a number of different algebraic log ics, which we will call Frege logic, Boolean logic, and unital Boolean logic. Although these logics are characterized by different classes of logical matrices, as we will see later, they are all strongly equivalent, which is to say that they
J Michael Dunn, Gary M Hardegree
openaire   +1 more source

Correspondence Analysis for Some Fragments of Classical Propositional Logic

Logica Universalis, 2021
In the paper, we apply Kooi and Tamminga’s correspondence analysis (that has been previously applied to some notable three- and four-valued logics) to some conventional and functionally incomplete fragments of classical propositional logic. In particular, the paper deals with the implication, disjunction, and negation fragments.
Petrukhin, Yaroslav, Shangin, Vasilyi
openaire   +1 more source

Tableau Methods for Classical Propositional Logic

1999
Traditionally, a mathematical problem was considered ‘closed’ when an algorithm was found to solve it ‘in principle’. In this sense the deducibility problem of classical propositional logic was already ‘closed’ in the early 1920’s, when Wittgenstein and Post independently devised the well-known decision procedure based on the truth-tables.
openaire   +2 more sources

Classical Propositional Logic - PC -

1990
In this chapter I will present the classical propositional logic which, I believe, is the simplest logic that can be developed from the assumptions of Chapter I. In this setting I present the notions of a formal language, a model, the logical form of a proposition, proof, consequence, and the notion of a logic.
openaire   +1 more source

Deciding intuitionistic propositional logic via translation into classical logic

1997
We present a technique that efficiently translates prepositional intuitionistic formulas into propositional classical formulas. This technique allows the use of arbitrary classical theorem provers for deciding the intuitionistic validity of a given propositional formula. The translation is based on the constructive description of a finite counter-model
Daniel S. Korn, Christoph Kreitz
openaire   +1 more source

tascpl: TAS Solver for Classical Propositional Logic

2004
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified Δ-tree representation of formulas in negation normal form. This new representation allows for a better description of the reduction strategies, in that considers only those occurrences of literals which are ...
M. Ojeda-Aciego, A. Valverde
openaire   +1 more source

Axiomatic Rejection for Classical Propositional Logic

1996
Axiomatic rejection is a method to recursively enumerate all the formulas not provable in the given formal system by way of a recursive set of axioms and rules, not necessarily finite.
openaire   +1 more source