Acessibilidade / Reportar erro

Should God believe the Liar? A non-dialetheist paraconsistent approach to God’s Omniscience * The authors acknowledge support from the John Templeton Foundation, research grant 61556.

Abstract

In this paper, we discuss a family of arguments that show the inconsistency of the concept of omniscience, which is one of the central attributes of the theistic God. We introduce three member of this family: Grim’s Divine Liar Paradox, Milne’s Paradox and our own Divine Curry. They can be seen as theological counterparts of well-known semantic paradoxes. We argue that the very simple dialetheist response to these paradoxes doesn’t work well and then introduce our own response based on a framework that we call Logic of Impossible Truths (LIT). LIT is a non-dialetheist paraconsistent logic designed to represent divine ominiscience and to preserve the transparency of the truth predicate and which semantics rests on the concept of situation. Since some rules of classical logic are not valid in LIT, we are in a position to block the derivation of the paradoxes. Thus, LIT offers a way out of the dilemma of accepting that there are true contradictions (dialetheism) or giving up the idea that there is an all-powerful, omniscient and perfectly good being (atheism).

Keywords:
Paradoxes; Omnscience; Truth; Dialetheism; Situation Semantics

1 Introduction

Theism is a theological theory that has at its core the idea that God is an omnipotent, omniscient and perfectly good being, who creates the world and everything else in it. Although the theist concept of God has been widely accepted by believers of many stripes, including Christians, Muslims and Jews, there are powerful arguments pointing out contradictions in theism. We call them arguments of impossibility, since they show that the theist concept of God is incoherent and cannot be satisfied by any natural or supernatural entity.

The most popular argument of impossibility in the history of philosophy is the well-known Paradox of the Stone, which aims to show the incoherence of the divine attribute of omnipotence by asking whether God can create a stone so heavy that he cannot lift. The arguments of impossibility we discuss in this article are not so famous as the Paradox of the Stone, but we think that they are so interesting and powerful as that argument and even harder to solve.

Grim (Grim, 1991GRIM, P. The Incomplete Universe. Cambridge: MIT Press, 1991) was the first to call attention to a family of arguments that jeopardize the coherence of the attribute of divine omniscience. We are especially interested in the argument he dubbed as the Divine Liar. In this paper, we present Grim’s Divine Liar argument and show that it is actually a recipe to build a family of paradoxes. We call them the Liars. We introduce then a new member of this family: the Divine Curry. Next we show that Cotnoir’s (Cotnoir, 2017COTNOIR, A.J. Theism and Dialetheism. Australasian Journal of Philosophy, 2017. DOI: 10.1080/00048402.2017.1384846
https://doi.org/10.1080/00048402.2017.13...
) dialetheist response to the Liars’ family is not adequate, because it weakens the connection between factivity, trust and divine omniscience. Our own response hangs on the semantic theory LIT we develop in section 4 of this article. We show that LIT is an appropriate logic for theism that blocks of the destructive power of the Liars. Finally, we draw some lessons from adopting LIT as a framework for the solution of paradoxes.

2 Paradoxes

The common understanding of the concept of omniscience is that an omniscient being knows everything, which means that this being knows the truth-values of every sentence or proposition about the past, present and future, no matter its content, as well the truth of eternal sentences, e.g. theorems of logic and mathematics. It also belongs to the set of basic intuitions concerning the concept of knowledge that the person who knows x is in a better position to provide information about x and make correct judgements on this matter. We then say that this person is reliable, that we can trust what she says. Likewise, an omniscient being must be seen as an absolutely reliable being, we must absolutely trust his words no matter what. The all encompassing character of God’s knowledge and the absolute reliability of God’s judgements are captured in the following definition of omniscience:

Definition 1. (Omniscience) A being x is omniscient iff for all sentence α, (i) α is true iff x believes that α, (ii) α is false iff x doesn’t believe that α, (iii) if α were true, then x would believe that α, and finally (iv) if α were false, then x would not believe that α.

Conditions (i) and (ii) are individually necessary for omniscience. Condition (i) is necessary because it excludes from the set of omniscient things that being who has very few beliefs or has true beliefs of a single type only (e. g. this being has some true beliefs based on perception and doesn’t form beliefs by reasoning or any other belief forming process). An omniscient being not only has true beliefs, but must have an infinite number of true beliefs of every kind imaginable. Condition (ii) is also necessary for omniscience, since it excludes from the set of omniscient things that being who is capable of thinking every conceivable sentence, but who also accepts everything that comes to her mind as being true. The point here is not only that an omniscient being must be able to correctly separate the set of sentences into two subsets, the one to which only the true sentences belong and the other to which only the false sentences belong, but also that the difference between believing the truth and only the truth and believing falsehoods really matters. In this way, an omniscient being will have a very exclusive set of beliefs, inasmuch as no falsehood is allowed in this set.

Conditions (iii) and (iv) are also necessary. First consider a person who has a true belief that α in a situation s 1, but would maintain her belief in a new situation s 2 similar to s 1, except that α is false in s 2. Even if this person has actually only true beliefs, she doesn’t look like an omniscient being. After all, she could easily make mistakes in her judgements. Consider now a person who would change her belief that α because of insignificant changes in her environment that are unrelated to the truth of α. We certainly wouldn’t say that she is omniscient, because she also could easily fall in error. In short, a being who is not able of tracking the truth of sentences in different situations doesn’t deserve to be called omniscient. Conditions (iii) and (iv) perfectly capture this important tracking aspect of the omniscience.

Conditions (i)-(iv) capture also the idea of an omniscient being as absolutely trustful. First consider a central function of knowledge attributions: when we say that a person knows that α, we single her out as a good informant, we distinguish her as someone capable of giving a reliable information about a topic that concerns us. As Craig (Craig, 1990CRAIG, E. Knowledge and the State of Nature. Oxford: Clarendon Press, 1990) puts it briefly, “the concept of knowledge is used to flag approved sources of information”. It looks like that we can say something similar about the attributions of omniscience. An omniscient being is an absolutely trustful source of information, which means that such a being has not only a maximal stock of truths at her disposal, but also that this being is not prone to error and track all truths in a reliable and infallible way. We can put it briefly in this way: to say that God is omniscient is also to say that we trust him and are ready to act accordingly to his words.

We assume that conditions (i)-(iv) are together sufficient for the attribution of omniscience and that our analysis is correct. So we can now state important rules related to the concept of omniscience. Let B represent the belief relation, g an individual constant that names God, and the formula B(g, α) the sentence that God believes that α is the case. We have then the following rules for omniscience:

(Capture) α B(g, α)

(Capture* ) ¬α ¬B(g, α)

(Release) B(g, α) α

(Release* ) ¬B(g, α) ¬α

Capture says that if α is the case, then we can infer that God believes that α, and Release says if God believes that α, it follows that it is the case that α. Capture* and Release* incorporate negation to these rules. So Capture* says that if it is not the case that α, then we can infer that God doesn’t believe that α, and Release* says that if God doesn’t believe that α, then it follows that it is not the case that α. We think that conditions (iii) and (iv) would also support more complex rules for the omniscience operator. But for now, we deal only with Capture, Release, Capture* and Release* rules, because they are enough to build the paradoxical arguments that are the focus of this article.

The starting point of Grim’s argument is the sentence of the Divine Liar:

(𝔡𝔩) God believes that (𝔡𝔩) is false

By the Principle of Bivalence (PB), (𝔡𝔩) is true or false. On the one hand, if (𝔡𝔩) is true, it follows by Capture that God believes that (𝔡𝔩), i.e. God believes that God believes that (𝔡𝔩) is false. Release says that every sentence that God believes holds and so we have: God believes that (𝔡𝔩) is false. We get now a problem. If (𝔡𝔩) is true, God believes that (𝔡𝔩) is false. Since God believes that (𝔡𝔩) is false while (𝔡𝔩) is in fact true, God believes a falsity. Therefore, if dl is true, God is not omniscient by the condition (ii) of the above definition. On the other hand, if (𝔡𝔩) is false, then it follows by Capture* that God doesn’t believe that (𝔡𝔩), God doesn’t believe that God believes that (𝔡𝔩) is false. By Release*, it follows that it is not the case that God believes that (𝔡𝔩) is false. In this way, given the assumption that (𝔡𝔩) is false, if God doesn’t believe that (𝔡𝔩) is false, then God doesn’t believe the true sentence that says that (𝔡𝔩) is false. Therefore, if (𝔡𝔩) is false, God isn’t omniscient by condition (i) of the above definition. Since it follows from the truth of (𝔡𝔩) and also from the falsity of (𝔡𝔩) that God isn’t omniscient, we conclude that God by no means is omniscient.

Grim develops his objection without appealing to the rules Capture, Release, Capture* and Release*, but his argument is essentially the same as the argument of the last paragraph. The following version of the Divine Liar argument is a bit different from Grim’s argument and establishes the explicit contradiction that 𝔡𝔩 is true and false at the same time. Assume that in the language we are talking about God’s attributes we have a predicate that is had by a sentence if and only if this sentence is not believed by God, and that we also have resources to build a self-referential sentence that says of itself that it has this predicate. Thus we have a sentence, 𝔡𝔩, such that, dl ¬B(g, dl ).1 1 To present the informal version of Divine Liar as it is given by Grim, we use (𝔡𝔩) as naming the sentence dl. From now on, we name this sentence with ⌜𝔡𝔩⌝. In arithmetical theories, corner quotes are used as numerals for Gödel-codings of formulas. Arithmetization of syntax allows obtaining self-reference in a strong and formal way. We also use corner quotes as naming functions, but we are not restricted to arithmetical language and arithmetical theories, since we are trying to grasp aspects of truth and God’s omniscience that appears in more inclusive fragments of natural language. Given these assumptions, the argument is the following:

  1. dl ¬B(g, dl) [Self-Reference]

  2. dl ¬dl [LEM]

  3. 𝔡𝔩 [Hypothesis]

  4. ¬B(g, dl) [1,3, and MP]

  5. ¬𝔡𝔩 [4, Release* ]

  6. dl ¬dl [3,5, and ∧+]

  7. ¬𝔡𝔩 [Hypothesis]

  8. ¬B(g, dl) [7, Capture* ]

  9. 𝔡𝔩 [1,8, and MP]

  10. dl ¬dl [7,9, and ∧+]

  11. dl ¬dl [2-10, and ∨−]

Semantic paradoxes are endless resources for creating problems for the concept of omniscience, as it is shown by Grim’s argument and our own version based on Self-Reference and the rules of Capture, Release, Capture*, and Release*.2 2 The reader might check that a contradiction follows from this equivalence even in an intuitionistic logic, in which LEM and Classical Reductio Ad Absurdum(RAA: ¬α → α ⊧ α) do not hold, but a special version of RAA (RAAI: α → ¬α ⊧ ¬α) and MP hold. As it should be clear by now, the paradoxical sentence 𝔡𝔩 is a theological version of the very well known Liar Sentence, a sentence that says of itself it is not true, with the only difference between the two that in the Liar Sentence the truth predicate takes the place of the omniscience predicate. Truth also delivers analogous rules like Capture, Capture*, Release, and Release* that are based on an important feature of the concept of truth, its Transparency. Thus we have a sentence 𝔩, such that, l ¬T (l), and a very similar argument to the one given above shows that a contradiction follows from the existence of l and Transparency.

In fact, we can create another interesting paradox of omniscience based on the so called Curry paradox. The trouble-making sentence of the Curry paradox is a sentence 𝔠 that is equivalent to a conditional that has T (c) itself as antecedent and an arbitrary sentence α as a consequent. From self-reference, there is a sentence 𝔠, such that c (T (c) α). From Transparency and substitution of equivalents, c (c α). This is a big trouble for paraconsistent theories of Truth, since the argument we can now build threatens of triviality any theory of truth in which Transparency, MP, and Contraction (or Conditional Proof - CP) hold.3 3 Contraction is the rule Γ,α → (α → β) ⊧ α → β . Conditional Proof (CP) is the property of ⊧ according to which, if Γ,α ⊧ β , then Γ ⊧ α → β . From either Contraction or CP, MP, and c ↔ (c → α) , we can prove α, whatever sentence we replace for α. We are going to argue that this problem shows up again in the discussion of the divine Curry paradox.

In order to state this theological version of the Curry paradox, assume again that in the language we are talking about God’s attributes (our theological theory of theism 𝒯) we have resources to build a self-referential sentence. In this way, we have the following sentence of the Divine Curry paradox:

𝔡𝔠) If God believes (𝔡𝔠), then God is Brazilian

Thus we have a sentence 𝔡𝔠, such that, dc (B(g, dc) t), where 𝔱 translates “God is Brazilian”. If we have this sentence in our theory 𝒯, then we can prove not only that God is Brazilian, but also that God isn’t Brazilian and any other sentence we like. In short, our talk about God would be trivial, since everything would be provable in 𝒯. We reason as follows:

  1. dc (B(g, dc) t) [Self-Reference]

  2. B(g, dc) (B(g, dc) t) [1, Subst. Equiv.]

  3. B(g, dc) (B(g, dc) t) [2,∧−]

  4. B(g, dc) t [3, Contraction]

  5. 𝔡𝔠 [1,4, MP]

  6. B(g, dc) [5, Capture]

  7. 𝔱 [4,6, MP]

The argument is valid for any arbitrary sentence replacing “God is Brazilian” in the consequent of the divine curry sentence, e.g. absurd sentences like “Grass is blue” and “I am a brain in vat”, as well as explosive sentences like “God is Brazilian and God isn’t Brazilian” that entail any other sentence. This situation makes 𝒯 a trivial theory.

We think that an argument like the Divine Curry makes the problem related to the concept of omniscience even harder to solve. In fact, the purported solutions to paradoxes like the Divine Liar that are based on a reinterpretation of classical negation won’t work as a solution to the Divine Curry, because this new paradox doesn’t involves essentially the negation as the Divine Liar does.4 4 On related issues concerning the Liar and Curry paradoxes, see Geach’s article On Insolubilia (Geach, 1955). Therefore, if we want to change the logical framework in order to give an unified response to the paradoxes, it is important to consider alternatives that incorporates an adequate conditional that rejects Contraction and Conditional Proof (CP) used to derive triviality in the the Divine Curry paradox.

3 A Very Simple Solution

A very simple solution to the paradoxes is to accept that the sentence dl is indeed believed by God, although this simple solution commit us to the claim that God believes contradictions. Cotnoir (Cotnoir, 2017COTNOIR, A.J. Theism and Dialetheism. Australasian Journal of Philosophy, 2017. DOI: 10.1080/00048402.2017.1384846
https://doi.org/10.1080/00048402.2017.13...
) comes to this startling commitment in his discussion of a member of the Liars’ family known as Milne’s Paradox. Before we go on the discussion of this commitment, let us first state Milne’s paradoxical argument. The starting point of the argument is the self-referential sentence “No omniscient being knows that which this very sentence expresses.”. Let O be the divine omniscience predicate, 𝔤 a term that refer to God and K the knowledge relation between a cognitive agent and a sentence. So we have the self-referential sentence λ, such that, λ ¬x(Ox K(x, λ)), which form the basis of the following argument:

  1. Og K(g, λ) [Hypothesis]

  2. K(g, λ) [1,∧−]

  3. λ [2,Factivity]

  4. ¬x(Ox K(x, λ)) [3, Self-Ref., and MP]

  5. ¬(Og K(g, λ)) [4,∀−]

  6. (Og K(g, λ)) ¬(Og K(g, λ)) [1-5, CP]

  7. ¬(Og K(g, λ)) [6, RAAI]

The first hypothesis says that God is omniscient and knows the sentence λ. The conclusion is reached by simplification (elimination of conjunction), the factivity of knowledge (a release rule for K), the inter-substitution of equivalents based on self-reference, quantifier elimination, Conditional Proof, and Intuitionistic version of Reduction (RAAI). Milne’s argument puts a terrible dilemma to theists. They have either to deny omniscience to God or to accept that God at the same time has and doesn’t have knowledge of λ.5 5 The reason is this: if God is omniscient, he knows all truths, including the truth expressed by λ, but λ just says that no omniscient being knows λ. How can theists avoid this dilemma?

Theists are not prone to take the first alternative and give up the idea of divine omniscience, since omniscience is a divine attribute deeply rooted in the theological tradition and it is displayed in many passages of holy texts like the Bible (e.g. “For he views the ends of the earth and sees everything under the heavens” [Job 28:24]) and the Koran (e.g. “There is nothing whatever like unto Him; and He is the All-Hearing, the All-Seeing” [Ash-Shura 42:12]). However, it is not easy to accept that God knows contradictions, since accepting contradictions could give rise to some troubling questions. Would we lost the property of factivity of knowledge by attributing to God knowledge of contradictions? Should we also give up the Release rule, since from the fact that God believes that α we could no longer infer that α is the case, since α could also be a false sentence? So far we can see, these are hard questions for which there would be no easy answers.

However, according to Cotnoir, we shouldn’t be bothered so much by this dilemma. In fact, his dialetheist response to Milne’s paradox is simply to affirm that God could believe contradictions. Moreover, he holds that the dilemma has no devastating power because we surely doesn’t loose neither the factivity of knowledge nor the Release rule. He says:

If we allow that God can know contradictions, we allow that God can know some false propositions. This is correct, as far as it goes; but, for the dialetheist, contradictions while being false may also be true. Only contradictions that are true (and false) can be known. Hence, the factivity of knowledge is preserved (Cotnoir, 2017COTNOIR, A.J. Theism and Dialetheism. Australasian Journal of Philosophy, 2017. DOI: 10.1080/00048402.2017.1384846
https://doi.org/10.1080/00048402.2017.13...
, p. 9)

The reason why the factivity of knowledge and the Release rule are preserved is that from the fact that God believes that α we still get α, even though we could also get ¬α if α is a contradictory sentence like Milne’s sentence λ. Perhaps we couldn’t always get something like the truth and only the truth, but that doesn’t seem to be a big problem and after all “you can’t always get what you want”.

Cotnoir’s dialetheist response to Milne’s paradox is very simple indeed, but is it right? In order to accept this response as correct we have to change our definition of omniscience in the following way:

Definition 2. Omniscience*: A being x is omniscient iff for all sentence α, (a) α is true iff x believes that α, (b) α is false iff x doesn’t believe that α, except if α is a true sentence as well, (c) if α were true, x would believe that α, and finally (d) if α were false, x would not believe that α, except if α were a true sentence as well.

In this definition, conditions (a) and (c) perfectly matches respectively the conditions (i) and (iii) of our previous definition of Omniscience. Condition (b) matches condition (ii) only partially, since in (b) we introduce the constraint that God believes a false proposition α in s 1 iff s 1 is a situation where α is a dialetheia, i.e. a sentence that is not only false, but also true. Likewise, (d) matches partially condition (iv), since in (d) we introduce the constraint that God in s 1 would believe a false sentence α in a situation s 2 iff s 2 were a situation where α is a dialetheia, i.e. a sentence that is not only false, but also true.

This new definition has some remarkable consequences. According to (b), if α is a dialetheia, α is not only true, but also false, that is, ¬α is also true, since the falsehood of a sentence is equivalent to the truth of its negation. Given Capture and Capture∗ rules, that amounts to say that God believes that α at the same time that he doesn’t believe that α. That is an absolute weird conclusion, to say the least. But that is not all. A related troublesome consequence of the new definition of omniscience is that we can lose the full trust in God’s words if his words are not to be seen as the truth and only the truth. In fact, there is no reason why someone shouldn’t refuse God’s teachings by alleging that they are false, even though they are also true, and there wouldn’t be any reason to disagree with him as well. There wouldn’t be also any strong moral compass provided by God’s commands if we couldn’t see theses commands as absolutely correct, and not correct and false at the same time. How should we act upon contradictory commands? Moreover, the relation between God and human creatures would be severely damaged, since God’s promises would always be covered with doubts: Trust the Lord and do good; dwell in the land and enjoy safe pasture. Take delight in the Lord, and he will give you the desires of your heart [Psalms 37: 3]. And the Psalm continues scorning the wrongdoers, praising the righteous and promising to them the land where they will dwell forever. Is that the truth and only the truth or this promise could also be false? No one believes that dubious promises could be binding and have enough impact to change the minds and hearts of human beings.

Of course, Cotnoir could improve his response to Milne’s paradox. To say that God believes contradictions is not to say that God believes any contradiction. Therefore, the consequences of accepting contradictions wouldn’t be so drastic as we have pictured in the last paragraph. Now it would be very important to distinguish the class of contradictions that would be acceptable from those that are not acceptable and this explanation won’t be so simple as the first response the dialetheist has given to paradoxes. A further complicating factor is this: even if the dialetheist succeeds in this first task, she will still owe us an explanation about why to distinguish the sets of acceptable contradictions from those that are not acceptable.

It has been a standard view defended in Logic, Metaphysics, and worldly-based semantics that inconsistency implies triviality. In Classical Logic, this view can be expressed by the Principle of Explosion (PE) (or Ex Falso Quodlibet ), according to which α,¬αβ holds for all sentences α and β, that means, an inconsistent set of sentences logically implies any and every sentence you want. The way that negation and disjunction are classically modelled entails PE.6 6 Let α and ¬α be both true. A disjunction is true iff at least one disjunct is true. Thus α ∨ β is true. From classical interpretation of negation, ¬α is true iff α is false. Thus α is false and α ∨ β is true. Therefore, β is true. The relevant aspect of negation and disjunction preserved in this proof is also known as Disjunctive Syllogism (DS). Perhaps, a good reason for PE is that the occurrence of true contradictions shouldn’t be expected under any theory or assumption, unless we are trying to prove its falsity. After all, contradictions are the most evocative and clear cases of falsity. So if we want to strongly separate truth away from falsehood or trustful from unreliable informants, we should be ready to pay the highest price. That means, we should accept anything to follow from contradictions, and try to avoid them.

Paraconsistency is the most strong reaction against PE. There are many different versions of Paraconsistency, many different philosophical ideas in support of such reaction, and also many different families of logics under this very inclusive brand that don’t validate PE. A philosophical motivation for Paraconsistency comes precisely from the alleged existence of true contradictions. For dialetheists7 7 See also (Priest, 2006), (Beall, 2009), and (Cotnoir, 2017). , the very concept of truth is inconsistent, and that would provide us with many true contradictions or dialetheias, like the paradoxical sentences 𝔡𝔩 and 𝔡𝔠 and their semantic counterparts 𝔩 and 𝔠. Of course, if the concept of truth is inconsistent, God’s omniscience carries the same fate as well. A dialetheist account of truth must provide a paraconsistent logic that not only avoids triviality but also actually solve the aforementioned paradoxes. As we saw, a dialetheist account of 𝔡𝔩 and 𝔡𝔠 has to face many challenges. An special concern in the present context is that we can not see how any reasonable version of theism can be based on Dialetheism, since it implies that God has not only true beliefs, but also false ones, and so his words could be unreliable at some point.

There seem to be very good reasons to block triviality. Non-triviality provides a minimal criterion to separate truth from falsity. There might be many incorrect theories that do not trivialize, but if a theory implies everything, it can not be seriously taken as correct, at least we cannot do this without straightly flirting with Relativism. This is probably one of the strongest reasons against triviality. In this way, except for the relativist, everyone agrees that triviality should be blocked. Nevertheless, Dialetheism is in an awkward position here. If you are a dialetheist, it seems that you have no right to complain about triviality. After all, you are not afraid of contradictions and you are not exactly avoiding falsity. So what makes triviality so scared and dangerous to you? For you, the main important reason against trivialism is lost forever.

Next, we develop a response to paradoxes of omniscience that is also paraconsistent, but unlike Cotnoir’s response to Milne’s Paradox, it preserves our intuitions about divine omniscience, is not burdened with attributions of contradictory beliefs to God and doesn’t give up the main reason for avoiding triviality.

4 The Logic of Impossible Truths (LIT)

We offer in this section a new framework for representing God’s omniscience and explaining away the paradoxical nature of 𝔡𝔩 and 𝔡𝔠 sentences and of their counterparts 𝔩 (the Liar sentence) and 𝔠 (the Curry sentence) in traditional semantic paradoxes as well. We name this framework as the Logic of Impossible Truths (LIT). As we are going to show, LIT-models provide not only a more intuitive account for the paradoxical sentences, but they also preserve Transparency of Truth, Capture and Release rules, Factivity and Reliability of God’s beliefs, consistency and non-triviality of reality. Besides LIT-models provide a non-vacuist interpretation to counterpossibles (counterfactual conditionals with impossible antecedents), which allows us to preserve closely related versions of conditions (iii) and (iv) of Omniscience.

Before proceeding with this presentation of LIT, let us first take an informal look at some aspects of this framework. LIT is a paracomplete paraconsistent logic based on Situation Semantics and a ceteris paribus conditional8 8 LIT inherits important aspects of Situation Semantics as given by Barwise & Perry (Barwise & Perry, 1999), Barwise & Etchemendy (Barwise & Etchemendy, 1987), and Mares (Mares, 2004). It also inherits something of the conditional semantics provided by Lewis (Lewis, 1973), Stalnaker (Stalnaker, 1968), and Nolan (Nolan, 2016). Nevertheless, LIT should not be taken to subsume any of those frameworks. . LIT-models evaluate sentences in situations in much the same way as worldly-based semantics do, but it doesn’t take situations as necessarily complete nor as necessarily consistent. In fact, there are inconsistent situations, although they will never deserve the status of real situations. Conditional and negative sentences will also receive modal treatments, since in order to evaluate them we take account not only of situations in which they hold, but situations in their neighbourhood too.

Situations are the building blocks of our framework. Roughly speaking, situations are ways reality could and could not be. Actual situations are pieces of reality, different parts of reality determined by the insertion of different informational agents in different space-time locations. Informational agents can be differently tuned to the same environment and so be capable of extracting different pieces of information from it. For example, at a meeting to discuss the divine liars and write this article, the authors share the same environment (the same slice of space-time) with Ideiafix, Guilherme’s pet dog. By its very accurate sense of smell, Ideiafix can extract pieces of information that we can not extract. On the other side, since we can read English, we can extract pieces of information from the screen of the laptop that Ideiafix can not extract, but only one of us can extract information from the German song playing on the radio.

Accordingly to this example, there are different situations that are at the same time actual, since they are different parts of reality determined by the insertion of different informational agents in different space-time locations. But neither Relativism nor Dialetheism follows from that account. We are not committed to the idea that we live in different worlds, e.g. one world where there is a delicious smell of a rubber ball behind the couch (Ideafix’s world) and a totally different world where there are exciting paradoxes to be solved (philosophers’ world), nor to the idea that we live in a world with true contradictions, e.g. a world where there is and there is not a delicious smell or an exciting philosophical problem. Actual situations are incomplete, they are determined by different ways in which the same reality is sliced, but there is just one reality.

Moreover, we are not committed to the idea that an informational agent always get things right. We hold that reality can not provide misinformation and some situations are silent about many topics. So, when an informational agent has false beliefs, her false beliefs are not truly based in actual situations, she is basing them somewhere else, namely in some non-actual situation. The non-actual situations are pieces of fictional (alternative) realities. But there are impossible non-actual situations too: non-actual situations can be impossible because we can fictionalize impossible alternatives. For example, a way that reality could not be is the one in which the cat in Schrödinger’s famous thought-experiment is at the same time dead and alive inside the box. This cat-dead-and-alive situation is a logically impossible (inconsistent) situation, but yet it is an alternative to actual situations that are just silent on the subject. As far we can see, there might be many different sorts of impossibilities (e.g. logical, physical, and metaphysical impossibilities), and LIT-models can be made more accurate in order to distinguish them. For present purposes, however, it suffices to show that there are inconsistent non-trivial situations and that actual situations are free from both contradiction and triviality.

As in worldly-based semantics, We can take situations as classes of sentences, which means, a situation s can be identified with the class of all sentences informed by s (sentences that are true in s). Later, we talk about situations as items of models that include interpretation functions (ν) that drive us from situations into sets of sentences. Thus the set of sentences we informally associate with s can be precisely identified with ν(s) under the presumed model.

As we said before, our framework is based on a class of ceteris paribus relations for conditionals. A ceteris paribus relation is always relative to a sentence, it relates a situation to all situations in which such sentence is true and everything else relevant is the same. For example, let s 1 be a situation in which you find yourself in while reading this article, that is, the set of facts holding around you at a given space-time location. Let us now assume that the sentence “There is intelligent life on other planets” (let’s represent it as α9 9 We use greek small letters for arbitrary formulas, but a more accurate representation for this sentence could be provided with quantifiers and predicate symbols. ) is not true in s 1 (s 1 doesn’t inform you about α). In the same way, a ceteris paribus relation R α relates s 1 to all situations where α is true but everything else relevant is the same. If s 1 R α s 2 and s 1 R α s 3, then α is true in both s 2 and s 3. Of course, s 1 , s 2 , s 3 are not exactly the same, but the only difference between them is related to α or something that doesn’t matter for the truth of α. Maybe in s 1 you are dressing a blue shirt, in s 2 a red one, and in s 3 a black one, for example.

A conditional sentence expresses a general (unspecifi relation of consequence and in that sense it says that the consequent follows from the antecedent (even if the antecedent doesn’t happen to be actually true). Thus, in order to evaluate a conditional sentence, we must take into account many different situations in which the antecedent is true. Consider for example the sentence “If there is intelligent life on other planets, we would already know about it”. Our present situation doesn’t verify nor falsify the antecedent of this conditional, we actually don’t know whether there is intelligent life on other planets of our universe. Should we give up the idea of evaluating this conditional? The answer is no! The fact that we don’t know whether there is intelligent life on other planets doesn’t hinder an intuitive assessment of the conditional itself. It seems that the conditional is false, because it is not only possible but also highly probable that some planets are far enough from Earth to make them entirely (causally, perceptually, and communicatively) isolated from us. Even though we don’t have any clues about the existence of intelligent life outside the planet Earth, intelligent unreachable creatures living on planets far away from us is a possible and highly plausible scenario. This scenario falsifies the conditional sentence, showing that the consequent does not follow from the antecedent.

LIT-models include inconsistent and other sorts of impossible situations and, therefore, ceteris paribus relations might relate possible situations to impossible ones. Consider the conditional sentence “If Schrödinger’s cat were both alive and dead inside the box, God wouldn’t believe that”. Since its antecedent (let us represent it by β) is impossible, it is not only a counterfactual but a counterpossible conditional. According to LIT-models, this conditional is verified in a normal situation s if there is no situation s 1 such that sR β s 1 and ¬B(g, β) is not true in s 1. In order to β ¬B(g, β) not to be true in s, there must be a situation s1 in which β is true too. Therefore, there must be an inconsistent situation in order to avoid what has been called Vacuism, the thesis according to which all counterpossibles are vacuoulsy true. As the reader can see with the current example, Vacuism would fight against conditions (iii) and (iv) of Omniscience.

While conditionals are evaluated under ceteris paribus relations, negative sentences should be evaluated under compatibility relation. Compatibility is a relation on situations, it relates all situations that do not contradict each other.10 10 We are precisely interested here in logical compatibility, but the relation could be redefined in order to grasp different senses of compatibility. Thus s 1 is incompatible with s 2 (we write s1 s2) iff s s asserts something that s 1 denies. s 1 is compatible with s2 (s1Cs2) iff they are not incompatible. That been said, ¬γ is true in a situation s iff there is no s 1, such that, sCs 1 and γ is true in s 1. Thus a situation informs about the negation of γ if it excludes γ, in the sense that γ is true in no situation compatible with such situation.11 11 The compatibility negation we are offering here is partially based on Routley semantics as formalized in Restall (Restall, 1999), Beall (Beall, 2009), Mares (Mares, 2004) and others.

As we have already pointed out, LIT-models admit inconsistent situations. Certainly, an inconsistent situation is not compatible with itself (and so the compatibility relation is not reflexive), but that doesn’t mean that it is absolutely incompatible. Let s1=α,¬α,β, s2=β,¬γ and s3=¬α,β. Thus s1 s1, s 2 Cs 2, s 3 Cs 3, s 1 Cs 2, s 2 Cs 3, and s1 s3. When a situation is inconsistent (self-incompatible) about some topic, it is also incompatible with all situations that say something about this topic. But a given situation can be compatible with many situations that remains silent on the topic on which it confl with itself. As we have also been emphasizing, many situations are incomplete, in the sense that they remain silent about many topics. The given example with situations s 1 , s 2 and s 3 also shows that compatibility is not a transitive relation. Of course, compatibility is symmetric.

We assume in our framework that for any situation s there is always a maximal-compatible situation with s. That means, we add the star operator on situations, such that, for all s, s 1, if sCs 1, then s1 s. The star operator might be seen as an extremely artificial device of formal semantics. But we think that this is the wrong way to think of situations. We have explained that not all situations are supposed to represent pieces of reality, only the actual ones. As we are going argue, if s is an actual situation, then s can not be actual.12 12 This is included ahead in what we call “Star Normality”. Despite of that, the point of treating negation as a modal operator is to consider sets of situations for the truth conditions of negative sentences. The star operator on a situation s determines a situation which is maximal-compatible with s.

One last remark about the star operator: if s is silent about some topic, s must contradict itself about that same topic, that means, if s is incomplete, s is inconsistent. For example, if neither α nor ¬α is true in s, then there are s 1 , s 2, such that, sCs 1, sC 2, α is true in s 1, and ¬α is true in s 2. Thus s1 s, s2 s, and s s. In the opposite direction now, if s is inconsistent (self-incompatible), s is incomplete. In order to see that, let s be such that both α and ¬α are true in s. Thus there are no s 1 such that sCs 1 and α or ¬α is true in s 1. Therefore the situation maximal-compatible with s must also remain silent about α, neither α nor ¬α is true in s . Of course, this is not supposed to exclude all contradictions from s : if s is also silent about B, then even if s does not contradict itself about α, it surely contradicts itself about β.

We present below LIT-Language, LIT-models, and logical consequence as defined on LIT-models. We also mention some important properties of LIT and relate them with paradoxical sentences.

Definition 3. Let ℒ be a formal language based on the following vocabulary: a denumerable set of variables {v 0 , v 1 , v 2 , ⋯}, a denumerable set of constants {k 0 , k 1 , k 2 , ⋯}, a denumerable set of n-place function symbols fn0,fn1,fn2,, a denumerable set of n-place predicate symbols Pn=Pn0,Pn1,Pn2, for each natural number n > 0, the set of logical connectives and quantifiers {¬,,,,, ∃}, and parentheses.13 13 We shall use x, y, z, ... for arbitrary variables, a, b, c, ... for arbitrary constants, α, β, γ, ... for arbitrary predicates or formulas, f, g, h, ... for arbitrary function symbols, and Γ, Σ, Π for arbitrary sets of formulas.

Some special symbols in the vocabulary of ℒ need to be stressed since they are going to be interpreted under fixed constraints for LIT-models we present later. Between constants we find a special one for God’s name, say k 0 (we write it as 𝔤). Between function symbols we find a one-place naming function symbol (which gives a name for each formula of ℒ), say f01 (we write it as ⌜...⌝). Between predicate letters we find a one-place truth predicate (say P10), a one-place omniscience predicate (say P11), and a belief two-place predicate, say P20. We write them, respectively, as T, O, and B.

Definition 4. The set of terms of ℒ is the least set including all constants, variables, and function symbols applied to terms. A term is closed iff there is no occurrence of a free variable in it. 𝒯 is the set of all closed terms.

Definition 5. The set of formulas of ℒ is the least set ℱ closed under the following conditions:

  • (a) If t 1 , ..., t n are terms and P is any n-place predicate symbol, Pt1, ..., tn .

  • (b) If α , then ¬α , (α β) , (α β) , (α β) .14 14 As usual, (α ↔ β) can be defined as (α → β) ∧ (β → α).

  • (c) If α is any formula, and x is any variable, xα(x) and xα(x) .

Definition 6. A sentence is a formula with no occurrence of a free variable in it. The set of sentences is called 𝒮.

Next, we define LIT-models for ℒ. Models are constrained by many important conditions we shall present in two different parts, one concerning logical constraints, and the other concerning general constraints on the constitutive relations of models.

Definition 7. A LIT-model for ℒ is a tuple M=D,S,N,@,RααS,ν according to logical and general constraints given ahead, where:

  • (a) D is a non-empty class of objects, the domain or universe over which we talk about (on which we interpret language ℒ). For each d D , we add a constant k d . Thus, for each model , we extend ℒ to ℒ.15 15 This is required for adopting a substitutional interpretation of the quantifiers.

  • (b) 𝒮 is a non-empty class of situations.

  • (c) N S is a non empty class of normal situations.

  • (d) @ S is the class of all actual situations in .

  • (e) is a ceteris paribus accessibility relation for sentence α on situations.

  • (f) ν is an interpretation function, such that, it drives us from closed terms of the extended language into the domain ( ν TLM D ), it drives us, for each situation s, from n-place predicates into n-tuples of the domain ( ν S × Pn Dn ), for all n 1 , and it drives us from situations into sets of sentences, those sentences that are true in such a situation under such interpretation ( ν S Pow(S) ). We add a special notation for “true in situation s under model ℳ”, say ℳ,s α . Thus ℳ,s α iff α ν(s) .

Notice that we opt here for a constant domain through all situations of a given model. However the interpretations of predicates and sentences are relative to situations. This is just a first extricate version of our framework, and we intend in future works to explore LIT-models with variable domains. Notice yet that this simplification do not force all situations to talk about everything inside the domain of the model, since partiality still stands.

It is important to observe that we are including within each LIT-model a set of normal situations. For ℳ to be a model, it must include situations that obey all logical constraints. There must be situations in which some of these constraints are not forced, but at least some situations are.16 16 Notice that there is no circularity in this strategy. It is a commom practice in non-normal modal logics. See chapter 18 of (Priest, 2008), for example. Normal situations are going to be closed under logical consequence, they are the logical situations. Of course, since we are considering also impossible situations, we must consider a radical sort of impossibility, the counterlogical situations, those situations that are not closed under logical consequence (at least they are not closed under logical consequence of LIT). There might be different levels of the impossible, like failure of natural laws, miracles, failure of conceptual laws, contradictions, and failure of the logical laws. Inside LIT-models, contradictions are taken as impossibilities but inconsistent situations can still be closed under the logical consequence provided by LIT. Not all inconsistent situations are counterlogical ones. Nevertheless, we might reason about situations in which even LIT rules fail, these are the non-normal situations.

Given the class of normal situations and the compatibility relation, we can partially define the class of Possible situations P. Let ℳ be a model, 𝒮 the class of situations of the model, N S the class of normal situations, and C a compatibility relation on S. Thus PsNsCs. Of course if s s, s P since consistency is a minimal criteria of possibility. If s N, s is a counterlogical situation, therefore s P. Notice that inconsistency does not necessarily imply non-normality nor vice-versa. There might be some weaker levels of impossibility to be distinguished later (maybe in a future work), like situations in which something travels faster then light, the future causes the past, identity fails for persons, and so on. That is the reason why we take P as just a subset of all normal self-compatible situations. This partial definition suffices for our present purposes.

LIT-models include a class of all ceteris paribus relation. For each sentence α S, it provides a relation Rα S2. It is more useful to take this relation as a function from situations into classes of situations (fα S Pow(S)), that means, fα(s)=s1SsRαs1. This function determines, for instance, the class of all situations, ceteris paribus with an actual situation s, in which Germany has won the WWII. A different function in the same class of the model delivers the class of situations, ceteris paribus with the actual situation s, in which Schrödinger’s cat is dead and alive inside the box. So this function relates an actual situation with a class of impossible situations, that means fγ¬γ (s) S P, where S P is the complement of possible situations of the model and γ ¬γ is the sentence “Schrödinger’s cat is dead and alive inside the box”.17 17 We are assuming here that “alive” is equivalent to “not dead”. Again, a more complex translation would take place here. This is just a simplification.

As a last general remark about LIT-models, consider that worlds can be intuitively understood as complete and consistent situations. Thus s S is a world of model ℳ iff, for all α S, either α is true in s or ¬α is true (α is false) in s. However, as we show in Proposition 14 ahead, there are no possible worlds, that means, if s is a world, s P since s s, for all s S of all models.

Consider now the logical constraints that models are supposed to fit for LIT-models:18 18 Notice that we are just providing constraints for the functions ν of LIT-models. Clause f of definition 7 already adds ⊩.

Logical Constraints: Let M=D,S,N,@,RααS,ν be a LIT-model, s S, s1 N , α, β S, P P0, and t1, ..., tn closed terms in TLM. Thus:

  • 1) M, s Pt1, ..., tn iff ν(t1), ..., ν(tn) ν(P ).

  • 2) M, s ¬α iff for no s2 S both sCs2 and M, s2 α.

  • 3) M, s α β iff M, s α and M, s β.

  • 4) M, s α β iff M, s α or M, s β.

  • 5) M, s1 α β iff fα(s1) [β]. 19 19 Where [β]=s∣M,s⊩β .

  • 6) M, s xα(x) iff M, s α(x/t), for all t 𝒯. 20 20 Where α(x/t) is the result of replacing all free ocurances of x in α with t.

  • 7) M, s xα(x) iff M, s α(x/t), for some t 𝒯.

Conjunction and disjunction behaves in a pretty classical way pace the aforementioned fact that LIT-models include both incomplete and inconsistent situations. We’ve already made the relevant comments about logical constraints about conditional and negative sentences. Still it is important to notice that all situations are closed under logical constraints for conjunction, disjunction, negation, and quantifiers, but only normal situations are closed under conditional constraints. There might be different levels of the impossible, but for now we are interested in paradoxical sentences like 𝔩, 𝔡𝔩, 𝔠 and 𝔡𝔠 and inconsistency and triviality are the only relevant types of impossibility that concern us. Since conditional sentences allows us to (non-vacuously) reason about the impossible, the conditional constraint should be restricted to normal situations; even if we reason about counterlogical, our reasoning is supposed to be fixed by our own logic (otherwise, it wouldn’t be really reasoning, right?).

Next we provide a list of general constraints for LIT-models that concern self-reference, compatibility relation, truth, omniscience, and ceteris paribus relations:

General Constraints: Let M = D, S, N, @, {Rα α S}, ν be a LIT-model, s,s1 S, α S, and β F any formula with a free occurrence of x. Thus:21 21 From now on we ommit any explicit mention to models when they can be unambiguously determined by the context.

  • 8) there is a sentence γ, such that, s γ iff s β(γ) (for all s N ). [Self-Reference]

  • 9) If s,s1 @ , then s,s1 N , and sCs 1. [Non-Dialetheism]

  • 10) There is s , such that, sCs and s2 s , for every s2, such that, sCs 2. [Star Postulate]

  • 11) s = s [Double Star]

  • 12) fα(s) [α], for all s N . [Identity]

  • 13) If s α , then s fα(s) , for all s N . [Weak Centering]

  • 14) If s N , then s S N . If s S N , then s N . [Star Normality]

  • 15) ν(s, T ) S , and if s N , s T (α) iff s α . [Transparency]

  • 16) ν(s, B) (DS)×S , for some s2 @, s2, O(g) , and, for all s N , if s O(g) , then s α iff s B(g, α) . [Omniscience]

Constraint 8 is introduced for allowing self-reference to play the game of paradoxes in LIT-models. As it is usually emphasized, natural languages provide many different sources for self-reference, e.g. indexicals, definite descriptions, and empirical circumstances.22 22 See Kripke (Kripke, 1975). In formal contexts, self-reference is usually delivered through arithmetization techniques, which is basically the essence behind the Diagonal Lemma. Here we accept that all normal situations include self-referential sentences like 𝔩, 𝔡𝔩, 𝔠, and 𝔡𝔠. In fact, we are pushing a stronger version of self-reference, since we are not expressing it by means of a biconditional, but as logical equivalence. Thus since ¬T (x) F, there is a sentence 𝔩 (the Liar Sentence), such that, for all s N , s l iff s ¬T (l) (for any model ℳ).

Constraint 9 is Non-Dialetheism. LIT is an alternative framework to Dialetheism, a paraconsistent non-dialetheist logic, designed for representing omniscience of God and transparency of truth. Thus we restrict models to those in which all actual situations are normal and self-compatible (consistent). We take Non-Dialetheism for granted, but we argue next that LIT-models provide intuitive answers to paradoxes and besides they are better ways for representing transparency of truth and omniscience.

Constraints 10 and 11 are the necessary constraints for LIT-negation to be as strong as FDE-negation. Because of 10 and 11, Double Negation and De Morgan rules hold in LIT. As we said before, we assume here that, for all s S, there is a a situation s that is the maximal-compatible situation with s. We also assume that s = s, that means, the maximal-compatible situation with s is s itself. Notice yet that if sCs, then s s (for all s S).

Constraints 12 and 13 are related to conditional sentences. Models restricted as in 12 are those in which Identity (α α) holds in all normal situations. Models restricted as in 13 are those closed under Modus Ponens (MP). Notice that 12 and 13 are both intuitive contraints on LIT models. 12 says that if sR α s 1, then s1 α, that means, a ceteris paribus situation in which α is true is a situation in which α is true. 13 says that if s α, then s is also a situation ceteris paribus in which α is true. A stronger version of 13 would say that if s α, s would be the only one situation ceteris paribus with s in which α is true. This would make sense if we were modelling similarity relations, but for now we are not concerned about that kind of relations. So Weak Centering suffices for our purposes.

Constraint 14 is about the relation between maximal-compatible situations and normal situations. The main point here is that the Star Operator jumps from side to side between normal and non-normal situations. Consider for example the empty situation s (such that ν(s) = ) and the full situation s 𝒮 (such that ν(sS ) = S). On the one hand, as we are going to prove below (Proposition 11, item 1), for all s N and all α S of all models, s α α (Identity). Thus s N. On the other, s 𝒮 is closed under all logical constraints. In fact, s 𝒮 is an explosive (trivial) situation, but yet sS N . It is important to note that s = sS and sS = s. The existence of the empty situation s is then required for Star Operator as the maximal-compatible situation with s 𝒮, the full, trivial and explosive situation. Moreover, since nothing is true in s , this situation is not closed under logical consequence and, therefore, s S N.

Constraint 15 is for Transparency of truth. The first conjunct of 15 says that in all situations of all models T is a predicate of sentences. The second conjunct says that it is a transparent predicate in all normal situations.

Constraint 16 is for God’s Omniscience. First it says that B is a relation between (non-sentences) things and sentences. Second it establishes that at least some actual situation informs about God’s Omniscience. Third it says that if s informs about God’s omniscience (s is a God-situation) then B(g, x) is like a truth transparent predicate in s. We are taking Theism for granted as much in the same way as we are taking Non-Dialetheism for granted. We offer LIT-models as an alternative framework for God’s Omniscience, one non-dialetheist version of Theism that deals with the aforementioned paradoxes.

Transparency of Truth is preserved in LIT. Constraint 15 gives us all versions of Capture and Release for truth in all normal situations (including the negative-clauses with *). Capture and Release versions of God’s omniscience, however, hold only for situations which inform God’s Omniscience. But the reader might be worried: if s B(g, α) for some actual s of some model and α true in s, does it means that we have an atheist model? There is no reason to worry. It makes no difference if s @ or not (and neither if s P or not), since what “s B(g, α)” tells us is that some situation doesn’t inform God’s Omniscience. We would have an atheist model if some actual s informed about God’s ignorance, but this will never happen, since such models are forbidden: all models include actual situations that inform God’s Omniscience. Notice that we also need some non-actual situations in order to present models for sentences like “If God didn’t believe that, then it would be false.”. As we are going to see in the next section (Proposition 20), we can also preserve Capture and Release rules for models.

With models restricted as in definition 5 with Logical and General Constraints, we can defi logical consequence (validity) as preservation of truth in all normal situations of all models.23 23 As usual, tautologies are special cases of validity, those formulas that follow from ∅.

Definition 8. Let Γ S and α S. Thus, Γ α iff there is no model M = @, N, S, {Rα α S}, ν and s N, such that, ℳ,s Γ and ℳ,s α.24 24 M , s ⊩ Γ sse M , s ⊩ β , for all β ∈ Γ .

We show now some important properties of LIT and relate them with paradoxical sentences.

Proposition 9.

LIT is paracomplete. α ¬α

LIT is paraconsistent. α ¬α β.

Proof. Let ℳ be a model with S=s, s1,s, s1, and α,β S, such that, s,s1 N, sCs 1, s α, s ¬α, s β, s1 α, s1 ¬α, and s1 β. Excluded Middle fails in s, Explosion fails in s 1.

Proposition 10. Let ℳ be a model with s S, and α S. Thus:

  1. s ¬ ¬ α iff s α .

  2. s α iff s ¬ α .

Proof.Item 1: Let s ¬α. From Star Postulate, and negation constraint, then sCs , and s α. Now let s α. From Star Postulate again, s1 α (for all s 1, such that, sCs 1). From negation constraint, s ¬α. Item 2: Let s α. From Star Postulate, and negation constraint, s ¬α. Now let s ¬α. From prop. 10.1, s α, but s = s (Double Star).

Proposition 11.

  1. α α. [Identity]

  2. α, α β β. [Modus Ponens]

  3. ¬¬α α. [Double Negation]

  4. ¬α ¬β ¬(α β). [De Morgan]

  5. ¬(α β) ¬α ¬β. [De Morgan]

Proof.Item 1: It follows from Identity constraint (13) and the logical constraint of the conditional (5). Item 2: Let ℳ be a model with s N , such that, s α, s α β. Thus fα(s) [β] (logical constraint of the conditional), and s fα(s) (Weak Centering). Therefore, s β. Item 3: Let ℳ be a model with s N , and s ¬¬α. From prop. 10, it follows that s ¬α, and s α. Now let s N, and s α. From prop. 10, s ¬α, and s α, but s = s (Double Star). Item 4: Let ℳ be a model with s N , s ¬α, and s ¬β. Suppose (for reduction) that s ¬(αβ). Thus, s α β, contradicting hypothesis. Now let s N and s ¬(α β). Thus s (α β). Therefore, s ¬α, and s ¬β. Item 5: Let ℳ be a model with s N, and s ¬(α β). Thus s α or s β. Therefore, s ¬α ¬β. Now let s N, and s ¬α or s ¬β. Thus s (α β), and s ¬(α β).

Proposition 12.

  1. β (α α). [Relevant Identity]

  2. α β, ¬β ¬α. [Modus Tollens]

  3. ¬α, α β β. [Disjunctive Syllogism]

  4. α (α β) α β. [Contraction]

  5. Γ, α β does not imply Γ α β . [CP]

  6. α ¬α ¬α. [RAAI]

Proof.Item 1: Consider a model with situations s, s 1 such that s N , s1 fβ (s) (thus s1 β), but s1 α α. Of course, s1 S N. Still, s β (α α). Item 2: Consider a model with s N , fα(s) [β], s ¬β, but s ¬α. Thus s α, and s β. Notice that if sCs, and s N , this model would not be available, but Star Normality assures us that s S N. Item 3: Consider a model with s N , s α ¬α, but s β. Of course, in this case, s s, but this is not a problem. Item 4: Consider a model with sN, fα(s)=s1, s1α, s1αβ, but s1 S N, and s1 β. Thus fα(s) [α β], but fα(s) [β]. Item 5:α β β (from item 1 of prop. 11). Now item 1 of prop. 12 provides a counter-example to item 5 of 12. Thus there is a model with s N such that fα(s) [β β], and for some s1 fα(s), s1 β β. Therefore fα(s) (S N ) . Item 6: Consider a model with s N , fα(s) [¬α], but s ¬α. Since s N, and so it is closed under the consequence relation, we have to conclude also that s α.

5 Paradoxes Again

In section 4 we introduced LIT language, models, and proved some important features of this logic. Now we finally use this framework to obtain the sentences l, dl, c, dc, and we show important results in LIT that are related to them.

Proposition 13. Let ℳ be a model with s N , and 𝔱 a triviality constant sentence. Thus:

  1. There is a sentence 𝔩, such that, s l iff s ¬T (l) . [Liar]

  2. There is a sentence dl, such that, s dl iff s ¬B(g, dl) . [Divine Liar]

  3. There is a sentence c, such that, s c iff s T (c) t . [Curry]

  4. There is a sentence 𝔡𝔠, such that, s dc iff s B(g, dc) t . [Divine Curry]

Proof. 1-4 follow from straight applications of self-reference constraint on the following formulas: 1. ¬T (x), 2. ¬B(g, x), 3. T (x) t, and 4. B(g, x) t.

In cases 3 and 4, t is a constant that represents triviality (explosion). In fact, we have a curry sentence and a divine curry sentence for each sentence of the language. Dealing with sentences where t takes the consequent position is just a simplification. Let us see now what are the consequences of these sentences from the point of view of LIT-models.

Proposition 14. Let ℳ be a model with s S. Thus:

  1. If s N , and sCs, then s l and s ¬l .

  2. If s N , and sCs, then s s .

  3. If s is a world, then s P .

Proof.Item 1: From prop. 13, and Transparency, if either s l or s ¬l, then s s (by MP). Therefore, if s N, and sCs, then s l and s ¬ lItem 2: It follows from prop. 14.1, and prop. 10. Item 3: Since worlds are complete situations, if s is a world, either s l or s ¬ l. From prop. 14.1, if s N, s s, therefore s P. If s S N, by definition s P.

Proposition 15. Let M be a model with s S. Thus:

  1. If s @ , then s dl and s ¬dl .

  2. If s @ , s is not a world.

Proof.Item 1: From Omniscience (constraint 16), there is an s1 @, such that, s1 dl iff s1 B(g, dl). From prop.13, s dl iff s ¬B(g, dl) (all s N). Thus if s @, and either s dl or s ¬ dl, there is an s 2 such that ν(s2) = ν(s) ν(s1), and s2 @, but s2 s2, contradicting constraint 9 (Non-Dialetheism). Item 2: From definition of worlds and proposition 14.1 (or 15.1.

Proposition 16. Let ℳ be a model with s N, and s sS . Thus s c .

Proof. From proposition 13, if s N, s c iff s T (c) t. From Transparency, s c iff s T (c). Thus, from MP, if s c then s t, i.e. everything is true in s. Therefore, there is only one normal situation in which 𝔠 is true, the explosive situation s𝒮.

Notice that if s N, and s c, then fT (c)(s) [t]. Therefore, there is s1 fT (c)(s) [t]. In this case, for such model to obey the aforementioned constraints, if s1 sS, then s1 N . What this shows is that for Curry sentences not to be true in a normal situation s, there must be a non-normal one s1 where the sentence c is true, but the consequent t is not (a non-explosive non-normal situation).

Proposition 17. Let M be a model with s @. Thus s dc.

Proof. According to Omniscience, there is s1 @, such that, s1 dc iff s1 B(g, dc). For all s N, s dc iff s B(g, dc) t. Thus if s @ and s dc, there is s2 @, such that, ν(s2) = ν(s) ν(s1), and s2 t (from two applications of MP), contradicting Non-Dialetheism.

Next we add some new definitions concerning models in order to provide stronger results about paradoxical sentences:

Definition 18. Let ℳ be a model and α S. Thus:

  1. α is true in ℳ iff there is some s @ such that s α .

  2. α is false in ℳ iff ¬α is true in ℳ.

  3. God believes α in ℳ iff some s @ is such that s B(g, α) .

  4. God disbelieves α in ℳ iff some s @ is such that s ¬B(g, α) .

Proposition 19. Let ℳ be any model. Thus:

  1. 𝔩 is neither true nor false in ℳ.

  2. 𝔡𝔩 is neither true nor false in ℳ.

  3. 𝔠 is not true in ℳ.

  4. 𝔡𝔠 is not true in ℳ.

Proof. It follows from definition 18, the assumption that actual situations are normal self-compatible (Non- Dialetheism), and propositions 14-17.

Proposition 20. Let ℳ be a model. Thus:

  1. God believes all (and only the) truths in ℳ.

  2. God believes no falsity in ℳ.

Proof. It follows from definition 18 and the fact that s ¬B(g, α) iff s B(g, ¬α), for all s N of all models.

Proposition 20 captures condition (i) and (ii) of definition of Omniscience provided in section 1. More importantly, it avoids the problem we raised against Dialetheism, namely the unreliability of God’s beliefs. Since no contradiction is true in actual situations of models, God believes all and only actual truths, and God disbelieve all and only actual falsities, the unreliability problem does not show up against LIT-models.

LIT-models also capture closely related versions of conditions (iii) and (iv) of the aforementioned definition. As we saw, some actual situations inform about God’s Omniscience. A non-actual situation s might include non-actual truths and might include even an inconsistent truth in it, but if this were a God-situation, it would also be true that in s God believes an inconsistent truth. Consider another example. Call cat the the cat-dead-and-alive situation from Schrödinger thought-experiment. Let γ ¬γ be the sentence “the cat is dead and alive inside the box”. Let cat be a God-situation. Thus cat P since cat cat. Nevertheless cat B(g, γ ¬γ).

It seems that unless non-normal situations are included under f α (s), when s is an actual God-situation, all instances of the schema α B(g, α) are going to be true in s (the same is valid for ¬α ¬B(g, α)). So God not only believes all actual truths, and disbelieves all actual falsities, but he would also believe alternative truths and disbelieve alternative falsities whereas such alternatives keep things inside normal consequences preserving God’s omniscience.

This is an interesting result: if Schrödinger’s cat were alive and dead inside the box, God would believe that. And this is even more interesting: if the Liar sentence were true, God would believe that. Both results are far from Dialetheism, since we are not saying that God actually believes the Liar, but that he would believe the Liar is telling the truth, even if what is told is an impossible truth. We take this result to get as close as it could reasonably be of conditions (iii) and (iv) of omniscience.

Before leaving this section, let us just say a few words about the results about paradoxical sentences that we proved in it. These propositions show that LIT provides a paracomplete paraconsistent framework in which both Transparency and Omniscience hold without contradiction. With a modal interpretation of both negation and conditional, we can preserve the consistency of actual situations by giving up their completeness. What does the incompleteness of actual situations mean? It means that completeness is not consistent with Transparency of truth and Omniscience of God. We believe that this idea of completeness being inconsistent with Transparency and Omniscience is somehow shared by many different theories. Dialetheism is precisely a case in point, but dialetheists preserve completeness by giving up consistency. Grim, on the opposite side of the debate, choose consistency and pay the price of incompleteness, but since he takes the concepts of Truth and divine omniscience to be inherently complete, he gives them up. Accordingly to him, truths and worlds are always incomplete, their extensions can never be taken as complete totalities. So there is no such thing as Truth nor an omniscient being like God. When we look at the results provided by LIT, we see a path-way between Scylla and Charybdis.

We agree with Grim that to intend to wrap reality and truth as a whole is naive and wrong. Grim provides an ingenious argument against the existence of the set of all truths.25 25 See (Grim, 1991), chapter 4. Let T=t1,t2,t3, be the set of all truths. Thus for each Σ Pow(T ), there is a truth about Σ, for example, t1, t1t1, t1t1,t2, etc. Thus there are as many truths as subsets of T, contradicting Cantor’s Theorem according to which T < Pow(T ).26 26 Using Cantor’s diagonalization procedure, Grim shows that the assumption that T and Pow(T) are equivalent leads to contradiction. So there cannot be the set of all truths. That’s really a very ingenious argument, also used by him in order to prove that there can be no set of all worlds. Grim is convinced that truth is an indefinite extensible concept, one for which we can not consistently give a complete extension. We agree. That result is behind the aforementioned result in our framework. Of course, Grim’s argument demands a lot in order to be formalized. It requires at lest a language in which we can talk about sets of sentences and do Set Theory. Now his argument can not be formalized in our framework, for instance. Nevertheless, we think that the incompleteness of actual situations in our framework mirrors his views about the indefinite extensibility of Truth and Reality. In LIT-models, all worlds are inconsistent. This is supposed to be understood as showing that worlds are (with all non-actual situations) just fictions. Whenever we think and talk about all-inclusive situations we fictionalize about completeness, since there can be no actual complete situation.

We agree with Grim on many points, but we don’t share his views on divine omniscience. Omniscience is well represented in LIT-models, despite its paracompleteness. Even if there is no such thing as a complete actual situation (a world), there is no reason to maintain that God is an impossible being. As already pointed out, if some actual s does not inform about God’s Omniscience, this doesn’t imply that God is not omniscient. For the same reason, an actual situation carrying information that God is omniscient is not supposed to carry all truths about reality as a whole. Remember that a situation is determined by the insertion of an informational agent in a space-time location. So we might not be able to express God’s point of view in our framework, that means, to represent a situation provided by the insertion of an universal informational agent in a universal space-time location. But we are able to express God’s omniscience in all partial slices of reality.

6 Final Remarks

We purpose LIT-models as an alternative framework to represent God’s Omniscience and Truth Transparency. In this article we have mainly focused on the motivations behind LIT and on the paradoxical sentences. Of course, there are many more different concerns to be addressed about this framework that we couldn’t exhaust in this article. We mention next some of them.

A very common and strong objection against paracomplete approaches to the Liar Paradox is the Problem of Revenge. Whatever the way you phrase paracompleteness (truth value gaps or third indeterminate values, for instance), it seems that we always leave open the road for stronger versions, if the language is strong enough to represent how we evaluate (or how we don’t evaluate) the paradoxical sentences. This is also known as the Hydra like nature of the paradoxes of self-reference, in the sense that every time you cut off one of their menacing heads, two even more menacing ones appear in the same place. The important question to be answered here is whether LIT-models leave open the route for Revenge. We plan a future article to deal precisely with this question.

As the reader surely have noticed, LIT language also doesn’t have the usual alethic modal operators for Necessity and Possibility. The concepts of Necessity and Possibility are crucial to our work, but we are neither defining nor axiomatizing them. The reason why we frame LIT-models with situations is that we understand conditional and negation as modal operators as well. It is surely important, in a future work, to relate usual accessibility relation with compatibility and ceteris paribus relation. This would allow us to extend LIT language with alethic modal operators like □ and ◊. This would be the focus of a second future work extending ideas in the present article.

As we mentioned in section 1, there are many different versions of paradoxes and arguments of impossibility against Theism based on the omni-attributes of God, like omnipotence and omnibenevolence. Omnipotence, for instance, gives rise to the well-known Paradox of the Stone. We believe these arguments of impossibility share the same assumption about completeness and consistency so deeply enlightened in LIT-models. Thus we also plan a future work applying LIT-models for different versions of arguments of impossibility.

6 References

  • BARWISE, J. and ETCHEMENDY, J. The Liar: An essay on truth and circularity. OUP. New York. 1987.
  • BARWISE, J. and PERRY, J. Situations and Attitudes. CSLI Publications 1999.
  • BEALL, JC. Spandrels of Truth. Oxfod. 2009.
  • BERTO, F., FRENCH, R., PRIEST, G., and RIPLEY, D. Williamson on Counterpossibles. Journal of Philosophical Logic, 47, pp 693-713. 2018. DOI: 10.1007/s11245-016-9424-x
    » https://doi.org/10.1007/s11245-016-9424-x
  • CRAIG, E. Knowledge and the State of Nature. Oxford: Clarendon Press, 1990
  • COTNOIR, A.J. Theism and Dialetheism. Australasian Journal of Philosophy, 2017. DOI: 10.1080/00048402.2017.1384846
    » https://doi.org/10.1080/00048402.2017.1384846
  • GEACH, P. On Insolubilia. Analysis, Volume 15, Issue 3, January 1955. DOI:10.1093/analys/15.3.71
    » https://doi.org/10.1093/analys/15.3.71
  • KRIPKE, S. Outline of a Theory of Truth. In Journal of Philosophy, volume 72, pp. 690-716. 1975. DOI: 10.2307/2024634
    » https://doi.org/10.2307/2024634
  • GRIM, P. The Incomplete Universe. Cambridge: MIT Press, 1991
  • LEWIS, D. Counterfactuals. Oxford 1973.
  • MARES, E. Relevant Logic: A Philosophical Interpretation. Cambridge, 2004.
  • NOLAN, D. Conditionals and Curry. Philosophical Studies, vol. 173(10). 2016. DOI: 10.1007/s11098-016-0666-7.
    » https://doi.org/10.1007/s11098-016-0666-7.
  • PRIEST, G. In Contradiction. OUP. Oxford. 2006.
  • PRIEST, G. An Introduction to Non-Classical Logic: From if to is. Cambridge University Press. New York. 2008.
  • RESTALL, G. Negation in relevant logics (How I stopped worrying and learned to love the Routley star). In D. M. Gabbay and H. Wansing, editors, What is Negation? , Applied Logic Series. Springer, 1999.
  • STALNAKER, R. A theory of conditionals. Studies in logical theory. American Philosophical Monograph Series, vol. 2, pp.98-112. 1968.
  • 1
    To present the informal version of Divine Liar as it is given by Grim, we use (𝔡𝔩) as naming the sentence dl. From now on, we name this sentence with ⌜𝔡𝔩⌝. In arithmetical theories, corner quotes are used as numerals for Gödel-codings of formulas. Arithmetization of syntax allows obtaining self-reference in a strong and formal way. We also use corner quotes as naming functions, but we are not restricted to arithmetical language and arithmetical theories, since we are trying to grasp aspects of truth and God’s omniscience that appears in more inclusive fragments of natural language.
  • 2
    The reader might check that a contradiction follows from this equivalence even in an intuitionistic logic, in which LEM and Classical Reductio Ad Absurdum(RAA: ¬α α α) do not hold, but a special version of RAA (RAAI: α ¬α ¬α) and MP hold.
  • 3
    Contraction is the rule Γ,α (α β) α β . Conditional Proof (CP) is the property of ⊧ according to which, if Γ,α β , then Γ α β . From either Contraction or CP, MP, and c (c α) , we can prove α, whatever sentence we replace for α.
  • 4
    On related issues concerning the Liar and Curry paradoxes, see Geach’s article On Insolubilia (Geach, 1955GEACH, P. On Insolubilia. Analysis, Volume 15, Issue 3, January 1955. DOI:10.1093/analys/15.3.71
    https://doi.org/10.1093/analys/15.3.71...
    ).
  • 5
    The reason is this: if God is omniscient, he knows all truths, including the truth expressed by λ, but λ just says that no omniscient being knows λ.
  • 6
    Let α and ¬α be both true. A disjunction is true iff at least one disjunct is true. Thus α β is true. From classical interpretation of negation, ¬α is true iff α is false. Thus α is false and α β is true. Therefore, β is true. The relevant aspect of negation and disjunction preserved in this proof is also known as Disjunctive Syllogism (DS).
  • 7
    See also (Priest, 2006PRIEST, G. In Contradiction. OUP. Oxford. 2006.), (Beall, 2009BEALL, JC. Spandrels of Truth. Oxfod. 2009.), and (Cotnoir, 2017COTNOIR, A.J. Theism and Dialetheism. Australasian Journal of Philosophy, 2017. DOI: 10.1080/00048402.2017.1384846
    https://doi.org/10.1080/00048402.2017.13...
    ).
  • 8
    LIT inherits important aspects of Situation Semantics as given by Barwise & Perry (Barwise & Perry, 1999BARWISE, J. and PERRY, J. Situations and Attitudes. CSLI Publications 1999.), Barwise & Etchemendy (Barwise & Etchemendy, 1987BARWISE, J. and ETCHEMENDY, J. The Liar: An essay on truth and circularity. OUP. New York. 1987.), and Mares (Mares, 2004MARES, E. Relevant Logic: A Philosophical Interpretation. Cambridge, 2004.). It also inherits something of the conditional semantics provided by Lewis (Lewis, 1973LEWIS, D. Counterfactuals. Oxford 1973.), Stalnaker (Stalnaker, 1968STALNAKER, R. A theory of conditionals. Studies in logical theory. American Philosophical Monograph Series, vol. 2, pp.98-112. 1968.), and Nolan (Nolan, 2016NOLAN, D. Conditionals and Curry. Philosophical Studies, vol. 173(10). 2016. DOI: 10.1007/s11098-016-0666-7.
    https://doi.org/10.1007/s11098-016-0666-...
    ). Nevertheless, LIT should not be taken to subsume any of those frameworks.
  • 9
    We use greek small letters for arbitrary formulas, but a more accurate representation for this sentence could be provided with quantifiers and predicate symbols.
  • 10
    We are precisely interested here in logical compatibility, but the relation could be redefined in order to grasp different senses of compatibility.
  • 11
    The compatibility negation we are offering here is partially based on Routley semantics as formalized in Restall (Restall, 1999RESTALL, G. Negation in relevant logics (How I stopped worrying and learned to love the Routley star). In D. M. Gabbay and H. Wansing, editors, What is Negation? , Applied Logic Series. Springer, 1999.), Beall (Beall, 2009BEALL, JC. Spandrels of Truth. Oxfod. 2009.), Mares (Mares, 2004MARES, E. Relevant Logic: A Philosophical Interpretation. Cambridge, 2004.) and others.
  • 12
    This is included ahead in what we call “Star Normality”.
  • 13
    We shall use x, y, z, ... for arbitrary variables, a, b, c, ... for arbitrary constants, α, β, γ, ... for arbitrary predicates or formulas, f, g, h, ... for arbitrary function symbols, and Γ, Σ, Π for arbitrary sets of formulas.
  • 14
    As usual, (αβ) can be defined as (αβ) ∧ (βα).
  • 15
    This is required for adopting a substitutional interpretation of the quantifiers.
  • 16
    Notice that there is no circularity in this strategy. It is a commom practice in non-normal modal logics. See chapter 18 of (Priest, 2008PRIEST, G. An Introduction to Non-Classical Logic: From if to is. Cambridge University Press. New York. 2008.), for example.
  • 17
    We are assuming here that “alive” is equivalent to “not dead”. Again, a more complex translation would take place here. This is just a simplification.
  • 18
    Notice that we are just providing constraints for the functions ν of LIT-models. Clause f of definition 7 already adds ⊩.
  • 19
    Where [β]=sM,sβ .
  • 20
    Where α(x/t) is the result of replacing all free ocurances of x in α with t.
  • 21
    From now on we ommit any explicit mention to models when they can be unambiguously determined by the context.
  • 22
    See Kripke (Kripke, 1975KRIPKE, S. Outline of a Theory of Truth. In Journal of Philosophy, volume 72, pp. 690-716. 1975. DOI: 10.2307/2024634
    https://doi.org/10.2307/2024634...
    ).
  • 23
    As usual, tautologies are special cases of validity, those formulas that follow from ∅.
  • 24
    M , s Γ sse M , s β , for all β Γ .
  • 25
    See (Grim, 1991GRIM, P. The Incomplete Universe. Cambridge: MIT Press, 1991), chapter 4.
  • 26
    Using Cantor’s diagonalization procedure, Grim shows that the assumption that T and Pow(T) are equivalent leads to contradiction. So there cannot be the set of all truths. That’s really a very ingenious argument, also used by him in order to prove that there can be no set of all worlds.
  • *
    The authors acknowledge support from the John Templeton Foundation, research grant 61556.
  • Article Info

    CDD: 111.1

Publication Dates

  • Publication in this collection
    13 Dec 2021
  • Date of issue
    Oct-Dec 2021

History

  • Received
    05 July 2021
  • Reviewed
    29 Oct 2021
  • Accepted
    04 Nov 2021
UNICAMP - Universidade Estadual de Campinas, Centro de Lógica, Epistemologia e História da Ciência Rua Sérgio Buarque de Holanda, 251, 13083-859 Campinas-SP, Tel: (55 19) 3521 6523, Fax: (55 19) 3289 3269 - Campinas - SP - Brazil
E-mail: publicacoes@cle.unicamp.br