Aristotle's Thesis is a negated conditional, which consists of one propositional variable
with a negation either in the antecedent (version 1) or in the consequent (version 2).
In this paper we focus on the intuitionistic propositional logic with one propositional variable
n); xj being a literal (a propositional variable
or its negation).
The basic idea of this encoding is that each term can be represented uniquely by a valuation of a set of propositional variables
, such that for each fluent f the propositional variable
Gamma] + [Lambda], [Delta] + [Pi]), and A is a propositional variable
where "x" is a first-order variable and "P" is a propositional variable
that has the same range as "x".
For any object x we introduce a propositional variable
X which denotes the computability of x.
We can see it as a proposition and we can associate it a propositional variable
that represents it.
For example, in the context of the dinner-date problem described previously, the propositional variable
More generally, in this intensional setting a single propositional variable
about which we know nothing else but that it is assumed to be true logically implies nothing but itself.
0] [right arrow] w) of propositional variables
These formulas extend propositional formulas by allowing both universal and existential quantifiers over propositional variables
, and are useful for modeling problems in artificial intelligence and computer science.