When Classical Logic is not Enough: Nonclassical Logics and Theological Reasoning

This is the eleventh part of a series developed through the Department of Philosophical Theology at the Institute of Lutheran Theology’s Christ School of Theology, exploring major results and developments in modern logic and their significance for philosophical and systematic theology.

Classical logic is extraordinarily powerful, so powerful in fact that one can easily begin to speak simply of 'logic' as though the classical system exhausted the possibilities of valid inference. The propositional calculus gives us familiar principles governing negation, conjunction, disjunction, and implication; first-order logic adds quantification and identity; model theory then permits us to specify satisfaction, consequence, validity, and interpretation with great precision. Much of the preceding series has depended upon precisely this framework, and nothing in what follows should be taken as withdrawing the confidence we have repeatedly placed in it.

Yet the development of logic in the twentieth century made clear that one need not abandon rigor in order to ask whether every feature of classical consequence is appropriate to every domain of reasoning. One can instead ask which principles are being used, what assumptions support them, and what changes when one of those assumptions is altered. This is the setting within which the various nonclassical logics emerged, not as one unified rebellion against classical logic, but as a family of formally disciplined attempts to revise particular features of consequence for particular purposes.

The plurality is important. Intuitionistic logic alters what may count as sufficient warrant for assertion and consequently declines to validate some classical principles. Relevant logics require a stronger connection between antecedent and consequent than material implication ordinarily supplies. Paraconsistent logics deny that contradiction must entail everything whatsoever, while many-valued logics permit semantic values other than the classical pair of truth and falsity. These systems do not all solve the same problem, and theology gains nothing by treating them as though they were variations upon one general theme called 'nonclassical logic'.

The more fruitful question is why theology might care about any of them.

Intuitionistic Logic: What Warrants the Assertion?

Classical logic validates the law of excluded middle:

P ∨ ¬P.

Either P or not-P.

It also validates double-negation elimination:

¬¬P → P.

If it is not the case that P is false, then P.

For classical reasoning these principles are familiar enough that one may hardly notice when they are being used. Intuitionistic logic, arising from Brouwer's philosophy of mathematics and subsequently formalized especially by Heyting, does not accept them unrestrictedly, not because the intuitionist is somehow more tolerant of contradiction, but because the standards governing assertion have changed. Under the constructive interpretation, asserting P requires an appropriate construction or proof of P, while asserting P ∨ Q requires having grounds for one disjunct or the other; consequently, the impossibility of ¬P need not itself amount to a constructive establishment of P.

The theological temptation here is obvious, and it should be resisted. It would be careless to claim that theological propositions are intuitionistic simply because faith is not mathematical proof, or to suppose that intuitionistic logic somehow captures religious trust better than classical logic. The connection is much more modest, but also more interesting, because intuitionistic logic forces us to ask a question theological argument often leaves implicit: What exactly warrants the assertion being made?

Consider the difference between

¬¬P

and

P.

Classical logic permits the passage from the former to the latter, whereas intuitionistic logic does not generally permit that inference. The distinction is useful because it forces us to ask whether showing that the denial of a proposition is untenable amounts to positively establishing the proposition itself. A theologian may successfully argue that a particular denial of divine action produces contradiction, but it remains a further question whether this alone establishes the particular positive account of divine action that the theologian wishes to defend.

One need not become an intuitionist in order to profit from the distinction. The formal system is valuable here because it makes visible an inferential step that ordinary theological prose can conceal, namely, the transition from the failure of a denial to the warrant for an affirmation.

Relevant Logic: What Has the Premise to Do with the Conclusion?

Classical material implication produces results that can initially seem peculiar. Since

P → Q

is classically equivalent to

¬P ∨ Q,

the conditional is true whenever P is false or Q is true, and consequently classical logic validates forms such as

P → (Q → P)

and

¬P → (P → Q).

These are often called paradoxes of material implication, though they are not contradictions within classical logic; they follow directly from the truth-functional definition of the conditional.

Relevant logicians ask whether a genuine relation of implication should require more than this. If we say that one proposition follows from another, should there not be some appropriate connection between the content of premise and conclusion? Relevant logics attempt to build such a requirement into the consequence relation itself, so that implication is not secured merely by the falsity of an antecedent or the independent truth of a consequent.

For theology the question is hardly peripheral, because theological discourse is saturated with conditionals. We say:

If Christ is risen, then …

If God creates ex nihilo, then …

If justification is by faith, then …

If God is immutable, then …

In such cases the theological force of the conditional ordinarily depends upon some intelligible relation between what is asserted in the antecedent and what is claimed in the consequent. We do not usually mean merely that the conditional happens to receive the value true under the truth table for material implication.

This is not yet an argument for replacing classical implication. It may instead be an argument for recognizing that many theological uses of 'if … then …' express more than the material conditional was ever intended to capture. The important point is therefore methodological: before formalizing a theological conditional, one must determine what sort of inferential relation the natural-language formulation is attempting to express.

Relevant logic helps precisely because it refuses to allow us to ignore that question.

Paraconsistent Logic: What Follows from Contradiction?

Perhaps no family of nonclassical logics is more immediately attractive to theologians, and perhaps none is more easily abused, than paraconsistent logic. Classical logic validates the principle commonly called explosion:

P, ¬P ⊢ Q.

From a contradiction, anything follows.

The principle does not mean that Q bears some hidden relation to P. Rather, once both P and ¬P have been admitted into a classical theory, every sentence becomes derivable, and the theory consequently loses its ability to discriminate among conclusions. In that technical sense, contradiction produces triviality.

Paraconsistent logics reject explosion. In a paraconsistent consequence relation, it is not generally the case that

P, ¬P ⊨ Q

for arbitrary Q, and therefore inconsistent information can be reasoned from without permitting every proposition to follow. What must be emphasized, however, is that paraconsistency does not by itself entail that contradictions are true; it entails only that contradiction need not produce inferential collapse.

This distinction is especially important in theology, where doctrines are often said loosely to be 'paradoxical' or even 'contradictory'. Christ is divine and human; God is one and three; the believer is righteous and sinful; God acts while creatures genuinely act. Yet none of these formulations has the form

P ∧ ¬P

unless one has first identified 'human' with 'not divine', 'three' with 'not one', or otherwise made the predicates contradictory in the same respect and under the same description.

Indeed, much of the history of Christian doctrine can be read as sustained resistance to exactly such conflations. Chalcedonian Christology does not say that Christ is finite and not finite in the same respect; Trinitarian doctrine distinguishes essence from person; the Lutheran formula simul iustus et peccator does not require that righteousness and sin be predicated univocally in the same respect. The logical discipline here lies not in invoking paraconsistency too quickly, but in determining first whether a genuine contradiction exists.

Paraconsistent logic becomes genuinely interesting when we confront a theological corpus, a historical tradition, or a developing theory that actually contains inconsistent commitments. Must everything then follow? A paraconsistent framework says no, and that can be useful when analyzing historically layered materials, competing doctrinal formulations, or theories under revision, because one can study the consequences of inconsistency without first pretending that the inconsistency is absent and without allowing the system to become trivial.

It is therefore essential to distinguish paraconsistency from dialetheism. The former concerns the behavior of consequence in the presence of contradiction; the latter is the metaphysical thesis that some contradictions are in fact true. One may use paraconsistent logic as a formal tool without thereby committing oneself to the reality of true contradictions, and theology should preserve that distinction with some care.

Many-Valued Logic: Must Every Proposition Be Simply True or False?

Classical propositional logic operates with two truth values, true and false. Many-valued logics generalize this architecture by permitting additional semantic values, though the significance of those additional values varies considerably from system to system. Some contain three values, others finitely many, and still others infinitely many; moreover, the extra values need not always be understood as degrees of truth, since they may instead represent indeterminacy, lack of information, semantic defect, or some other feature of the evaluation.

The theological temptation must again be controlled. The existence of many-valued logics does not establish that theological truth itself comes in degrees, nor does it show that mystery or doctrinal controversy requires intermediate truth values. What these logics do show is that bivalence is a semantic choice that can be examined rather than silently presupposed in every domain.

Suppose, for example, that we consider a predicate such as

x is mature in faith.

At what precise point does this predicate become true? If there is no sharp boundary, the issue may concern vagueness rather than either contradiction or theological confusion. Similar difficulties arise with predicates such as 'orthodox', 'responsible', 'culpable', 'spiritually mature', and even, in some contexts, 'alive' and 'dead', where biological or conceptual boundaries may be difficult to draw sharply.

A many-valued semantics offers one family of ways of representing such cases. It is not the only family, since supervaluationism, epistemicism, contextualism, and other theories compete with it, but the formal possibility is philosophically useful because it prevents us from assuming without argument that every semantically difficult case must still admit a sharp classical assignment of exactly one of two values.

The lesson for theology is therefore not that truth is fuzzy. It is that the semantics appropriate to a theological predicate must be investigated rather than assumed.

Which Logic for Theology?

At this point one might ask which logic theology should use, but the question is too coarse if it is understood as demanding one system for every theological task. There is no reason to suppose that theology needs a single nonclassical logic to replace classical logic across the board, and there is every reason to retain classical first-order logic for the enormous range of theological reasoning for which its proof theory, semantics, and inferential behavior are entirely adequate.

The existence of nonclassical logics does not overthrow classical logic. What it does overthrow is the assumption that every feature of classical consequence lies beyond philosophical examination. Intuitionistic logic asks what licenses assertion; relevant logic asks what connection implication should require between premise and conclusion; paraconsistent logic asks whether inconsistency must entail triviality; many-valued logic asks whether every semantic domain is adequately represented by exactly two truth values.

What has happened, accordingly, is not an abandonment of logic but a deepening of the philosophy of logic, because logical consequence itself has become an object of investigation. Earlier in this series we asked what follows from a theory, what structures satisfy it, whether the intended structure can be characterized, whether truth can be defined within the relevant language, whether consequences can be mechanically decided, and whether possible-world semantics supplies a sufficiently fine-grained account of content. Nonclassical logic now asks a question prior to many of those questions: Which relation of consequence are we employing when we say that one proposition follows from another?

The answer cannot simply be read off from the theological subject matter. The doctrine of the Trinity does not announce that its proper formal reconstruction must be classical, relevant, paraconsistent, or intuitionistic, nor does the Incarnation tell us in advance what sort of logical system best represents the relations among its propositions. One must first determine what the doctrine actually asserts, whether its apparent tensions are genuine contradictions or merely differences of respect, what kinds of conditionals occur within the argument, and what semantic distinctions the doctrine itself requires.

Only after that work has been done does the choice of formal machinery become philosophically responsible.

There is a danger in both directions. One can force every theological claim into classical form and conclude that whatever does not fit must be confused, or one can invoke a nonclassical logic whenever a doctrine appears difficult and thereby protect a defective formulation from criticism by simply changing the consequence relation. Neither procedure is satisfactory, because in both cases logic is being selected before the theological and semantic work has been done.

The choice of logic should instead follow from an analysis of the inferential phenomena one is attempting to represent. If the problem is vagueness, paraconsistency may be beside the point; if the problem is inconsistent information, many-valuedness may not address it; if the issue concerns the relation between antecedent and consequent, intuitionistic logic does not automatically solve it. Different logics revise different structures, and therefore there is no generic escape hatch labeled 'nonclassical'.

Why It Matters for Theology

Nonclassical logic matters for theology because it reveals that our conception of consequence already contains philosophical commitments. Classical logic gives powerful and often entirely appropriate accounts of theological reasoning, but its principles are better understood when we know what alternatives would look like and which features of inference those alternatives modify.

The discipline imposed by nonclassical logic is therefore double. We must specify exactly which classical principle appears inadequate for the task before us, and we must also identify what is gained and what is lost when that principle is revised. Merely changing the logic does not settle the theological question, since every alteration in consequence brings with it new semantic and proof-theoretic commitments of its own.

For theology this discipline can be salutary, because it forces distinctions that theological rhetoric too easily obscures. Apparent contradiction must be distinguished from genuine contradiction; material implication from explanatory or relevant connection; lack of proof from falsity; vagueness from inconsistency; mystery from contradiction; and formal tolerance of inconsistency from the metaphysical claim that some contradiction is actually true.

These are not logical niceties added after the theological work is complete. They belong to the conditions under which theology can say clearly what it means to say.

The most important lesson, therefore, is not that theology needs another logic, but that theology should know what its logic is doing, what it permits, what it forbids, and why. Once that much has been learned, the existence of alternative logics becomes less threatening and more useful, because each can be treated not as a rival worldview but as an instrument for testing the assumptions built into a particular account of consequence.

This brings us naturally to the final installment of the series. We began with Frege, Peirce, and Cantor, where modern logic dramatically enlarged the resources available for formal expression; we moved through model theory, completeness, incompleteness, compactness, truth, computability, modality, second-order logic, and hyperintensionality; and we have now reached the point at which consequence itself can be formally varied.

It is therefore fitting to return at the end to Gödel. His ontological argument brings together much of the machinery accumulated along the way: quantified modal logic, higher-order resources, necessity, possibility, formal derivation, and the distinction between the validity of an argument and the truth or adequacy of the axioms from which it proceeds. The final question will not be whether logic can 'prove God', but something more precise and, I think, more interesting: what exactly has been established when a theological argument has been successfully formalized and proved valid?

Bibliographical Note

The modern study of intuitionistic logic grows from L. E. J. Brouwer's philosophy of mathematics and Arend Heyting's subsequent formalization of intuitionistic reasoning. Alan Ross Anderson and Nuel Belnap's work on entailment became foundational for relevance logic. Stanisław Jaśkowski and Newton da Costa were among the major pioneers of paraconsistent logic, while subsequent work by Graham Priest and others developed its philosophical implications. Jan Łukasiewicz's work on three-valued logic, initially associated especially with future contingents, helped initiate the systematic study of many-valued logics. These traditions should not be treated as a single alternative to classical logic, since each revises different features of classical consequence for different formal and philosophical purposes.

Löwenheim–Skolem: When a Theory Cannot Control the Size of Its Models

This essay is part of a series developed through the Department of Philosophical Theology at the Institute of Lutheran Theology’s Christ School of Theology, exploring major results in modern logic and their significance for philosophical and systematic theology.

Gödel’s completeness theorem established a remarkable correspondence between syntax and semantics: if a sentence follows semantically from a set of first-order premises, then it can also be formally proved from those premises. The incompleteness theorems then showed that sufficiently strong formal theories cannot decide every sentence expressible within them.

The Löwenheim–Skolem theorems reveal a different limitation, one not primarily concerning proof but models. Even when a first-order theory says enough to describe an infinite structure in considerable detail, the theory may prove unable to determine how large its models must be. A theory possessing one infinite model will, under the usual conditions, possess models of very different infinite sizes.

The result is one of the deepest lessons of modern logic: a theory may say a great deal about a structure without uniquely determining the structure that satisfies it.

From Sentences to Structures

A first-order theory consists of sentences in a formal language. A model of that theory is a structure in which all those sentences are true.

Suppose, for example, that a language contains a two-place relation symbol R and that a theory says various things about how objects are related by R. One model might contain ten objects, another a thousand, and another infinitely many. Whether all these structures are possible models depends upon what the theory actually says.

If a theory explicitly says that there are exactly three objects, then a model containing four objects will not satisfy it. But infinite structures behave differently. Once a first-order theory has an infinite model, the Löwenheim–Skolem results severely restrict the theory’s ability to determine the cardinality of its models.

This is sometimes described as the elasticity of first-order theories.

The Downward Löwenheim–Skolem Theorem

The result begins historically with Leopold Löwenheim and was subsequently sharpened and clarified by Thoralf Skolem.

In one familiar form, the downward Löwenheim–Skolem theorem says:

If a first-order theory in a countable language has an infinite model, then it has a countable model.

Here “countable” means that the members of the model can, in principle, be placed into one-to-one correspondence with the natural numbers:

1, 2, 3, 4, …

This is surprising because the original model might be enormously larger than countable. It might contain uncountably many objects. Nevertheless, if the language is countable and the theory has an infinite model at all, then there is also a countable structure satisfying exactly the same theory.

A more structural formulation says that an infinite structure in a suitably small language has a smaller elementary substructure. We sometimes write:

M ≺ N.

Read: M is an elementary substructure of N.

This means much more than merely saying that M is contained within N. The smaller structure preserves the first-order truths of the larger structure, at least with respect to elements belonging to M. If a first-order formula with parameters from M is true in N, it is also true in M, and conversely.

The smaller structure can therefore be genuinely smaller while remaining indistinguishable from the larger one by the relevant first-order formulas evaluated on its members.

That is already philosophically striking.

The Upward Löwenheim–Skolem Theorem

The result also runs in the other direction.

In simplified form:

If a first-order theory has an infinite model, then it has models of arbitrarily large infinite cardinalities.

Thus a theory that has one infinite model ordinarily does not merely admit a countable alternative. It has models larger and larger without end.

Suppose a theory T has an infinite model. Then, under the appropriate conditions, T will have a model of cardinality ℵ₀, another of cardinality ℵ₁, another of still greater cardinality, and so forth through arbitrarily large infinite sizes.

We should be careful about what this does and does not mean. It does not follow that every structure can be enlarged or reduced arbitrarily while preserving all of its properties. Nor does it follow that cardinality is irrelevant. The theorem concerns what can be controlled by first-order theories.

The point is instead that first-order description has a remarkable inability to pin down the size of an infinite model.

This has an important consequence. If a first-order theory has an infinite model, it cannot be categorical across all infinite cardinalities. That is, it cannot have exactly one model up to isomorphism when models of every infinite size are considered, because models of different cardinalities cannot be isomorphic.

The theory may characterize much, but it cannot characterize everything.

The Skolem Paradox

The most famous philosophical puzzle associated with these results appears when they are applied to set theory.

Standard set theory proves that there are uncountable sets. The real numbers, for example, are uncountable: there can be no one-to-one correspondence between the natural numbers and the real numbers.

Yet set theory can be formulated in a countable first-order language. If that theory has a model, the downward Löwenheim–Skolem theorem tells us that, under the relevant assumptions, it has a countable model.

We now seem to have a contradiction.

The countable model satisfies the sentence:

The real numbers are uncountable.

Yet from outside the model we can count all the objects in its domain, including the objects that the model takes to constitute the real numbers.

How can a countable model contain something it correctly describes as uncountable?

The answer lies in understanding what “uncountable” means inside the model.

To say that a set R is uncountable is to say that there is no bijection between the natural numbers and R. But when the model says that no such bijection exists, its quantifiers range only over functions and objects available within the model.

From outside the model, we may be able to define or identify a correspondence that enumerates the members that the model calls “the reals.” But that correspondence need not itself be an object belonging to the model.

Consequently the model can correctly satisfy:

There is no bijection between the natural numbers and the real numbers

even though someone standing outside the model can enumerate all the members of the model.

There is therefore no formal contradiction. What appears paradoxical arises because “there exists a function” is interpreted relative to the structure in which the sentence is being evaluated.

The Skolem paradox is thus not really a contradiction but a lesson in semantics.

What the Paradox Teaches

The lesson is easy to underestimate. Truth in a model depends not only upon the sentence being considered but also upon the domain over which its quantifiers range and the interpretations assigned to its nonlogical vocabulary.

When a model says:

There is no function f with property P,

the quantifier “there is no function f” ranges over what the model recognizes as functions. It does not automatically range over every object that some external observer might regard as a possible function.

The distinction between the internal and external standpoint therefore becomes crucial.

From within the model:

R is uncountable.

From outside the model:

The collection of objects that the model takes to constitute R is countable.

Both statements can be true because they are made relative to different domains of quantification.

This is one reason model theory proved philosophically explosive. Formal semantics forces us to ask not merely whether a sentence is true, but true in what structure, under what interpretation, and with quantifiers ranging over what domain?

What Might Theology Learn?

The Löwenheim–Skolem theorems do not show that theological language is hopelessly indeterminate, nor do they prove that religious doctrines can have any interpretation one wishes. Still less do they establish theological relativism. Such conclusions would greatly outrun the mathematics.

Their theological importance lies elsewhere.

Whenever theology is formalized, one must distinguish between a theory and the structures satisfying that theory. A set of theological sentences may impose substantial constraints upon its models without uniquely determining one model. The fact that several structures satisfy the same sentences therefore need not indicate ambiguity or inconsistency; it may instead disclose something about the expressive resources of the language in which the theory has been formulated.

Suppose, for example, that a theological theory T contains propositions concerning creatures, divine action, dependence, justification, or participation. We can ask whether a proposed structure M satisfies T:

M ⊨ T.

Read: the model M satisfies the theory T.

But suppose another structure N also satisfies T:

N ⊨ T.

It does not follow merely from these two facts that M and N are the same structure, or even that they are isomorphic. The same formal theory may admit genuinely different models.

This matters because theology often moves too quickly from the claim that a doctrinal formulation is true to the assumption that the formulation uniquely determines the metaphysical structure making it true. Model theory forces those claims apart. A theory may constrain reality without exhausting every structural feature of the reality that satisfies it.

The point becomes particularly important when theology employs language about totality, infinity, divine knowledge, created orders, or relations among persons. The Löwenheim–Skolem theorems remind us that what a formal language can distinguish depends upon its expressive resources. Two structures may differ substantially while remaining indistinguishable with respect to the sentences available in a particular first-order theory.

This does not imply that reality itself is indeterminate. It implies that description and determination are different things.

A map can fail to distinguish two terrains without the terrains themselves becoming identical. In much the same way, a formal theological language may fail to distinguish structures that differ in respects the language cannot express.

There is consequently a methodological warning here. The theologian should not infer:

Our theory has a model; therefore we have uniquely described the reality under discussion.

Nor should one infer:

Two models satisfy the same theological theory; therefore there is no fact of the matter about which structure is correct.

Neither conclusion follows.

The first overestimates the expressive power of the theory; the second confuses limitations upon description with limitations upon reality.

Intended Models and Theological Reference

The Löwenheim–Skolem results therefore raise a question that becomes increasingly important in the philosophy of logic: if many structures satisfy the same theory, what makes one of them the intended interpretation?

Mathematics encounters this question when it speaks of the natural numbers or the set-theoretic universe. Theology encounters an analogous problem whenever formal representations are used to speak about God, creation, Christ, justification, or the Trinity. The formal theory does not itself guarantee that every model satisfying its sentences captures everything the theologian intends to say.

Something more may be required: historical usage, semantic intention, causal relations, practices of reference, further axioms, richer logical resources, or substantive metaphysical commitments.

The important point is not that formalization fails. Quite the contrary. Formalization succeeds precisely by revealing where the formal theory ends and further philosophical questions begin.

Löwenheim and Skolem thus teach theology something different from Gödel. Gödel showed that formal proof has limits even within sufficiently strong theories. Löwenheim–Skolem shows that semantic description has limits of another sort: an infinite first-order theory may be satisfied by structures of radically different sizes.

The resulting lesson is both modest and profound. A theory is not its model, and a model satisfying a theory need not be the only model capable of doing so.

For philosophical theology, that distinction is indispensable whenever we ask what our doctrines say, what structures make them true, and how much of theological reality those doctrines formally determine.

The natural next step is compactness, for compactness explains another remarkable feature of first-order theories: if every finite portion of a theory can be satisfied, then the entire theory can be satisfied. Together with Löwenheim–Skolem, this result will show just how surprising the relation between local consistency and global model existence can become.

Bibliographical Note

Leopold Löwenheim’s foundational result appeared in “Über Möglichkeiten im Relativkalkül” (1915). Thoralf Skolem subsequently reformulated and strengthened the result in several papers, including “Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze” (1920) and “Einige Bemerkungen zur axiomatischen Begründung der Mengenlehre” (1922), the latter containing the discussion that gave rise to what came to be called the Skolem paradox.

For modern treatments, the Löwenheim–Skolem theorems are standard results in model theory and mathematical logic. Useful sources include C. C. Chang and H. Jerome Keisler, Model Theory; Wilfrid Hodges, A Shorter Model Theory; and standard introductions to mathematical logic treating elementary substructures, cardinality, and first-order theories. Philosophically, the Skolem paradox has remained important because it raises enduring questions concerning reference, intended interpretation, internal and external perspectives, and the relation between formal theory and mathematical structure.

Gödel: Completeness, Incompleteness, and the Limits of Formal Reason

This essay is a product of the Department of Philosophical Theology at Christ School of Theology, Institute of Lutheran Theology, and is part of the Disputationes series on important results in logic and their significance for theology.

The foundational work of Frege, Peirce, Cantor, Russell, and Zermelo made possible a remarkable hope. Perhaps mathematics could be placed upon completely explicit foundations, so that one could specify a formal language, identify axioms, formulate rules of inference, and determine exactly what followed from what. Logic would then no longer depend merely upon intuitive judgments concerning valid argument, since proofs themselves could become mathematically tractable objects whose structure and consequences could be precisely investigated.

Kurt Gödel changed our understanding of this project forever, and he did so by proving two results that initially appear to point in opposite directions. His completeness theorem of 1930 demonstrated the extraordinary power of first-order logic, while his incompleteness theorems of 1931 demonstrated equally extraordinary limitations upon sufficiently strong formal theories. To understand why these results are not in conflict, and why both matter for philosophical theology, one must distinguish with some care the logic within which proofs are constructed from the particular theories formulated within that logic.

Completeness: Proof and Truth Meet

Suppose we have a collection of sentences Γ and another sentence φ. We can then ask two different questions, one syntactical and the other semantical. Does φ follow syntactically from Γ, so that φ can be derived from Γ by the rules of a specified proof system, or does φ follow semantically from Γ, so that φ is true in every structure in which all the sentences belonging to Γ are true?

In compact notation we distinguish

Γ ⊢ φ

from

Γ ⊨ φ.

The first expression says that φ is formally derivable from Γ, whereas the second says that every model satisfying all the sentences in Γ also satisfies φ. The distinction is basic, for the first concerns what can be proved by operating with formulas according to formal rules, while the second concerns what must be true in any structure in which the premises are true.

Soundness tells us that proof cannot outrun semantic consequence:

If Γ ⊢ φ, then Γ ⊨ φ.

In ordinary English, if φ can be correctly proved from Γ, then φ is true in every model in which Γ is true. A sound proof system therefore never certifies as a consequence something that fails to hold in a model satisfying the premises.

Gödel's completeness theorem establishes the converse for first-order logic:

If Γ ⊨ φ, then Γ ⊢ φ.

That is, if φ is true in every model satisfying Γ, then there is a formal proof of φ from Γ. Thus, for first-order logic,

Γ ⊨ φ if and only if Γ ⊢ φ.

Semantic consequence and formal derivability therefore coincide at the level of first-order logical consequence. This is a magnificent result, not because every mathematical truth becomes formally provable, but because first-order logic possesses a proof system powerful enough to capture every consequence that follows purely in virtue of first-order logical form.

Then Comes Incompleteness

Only a year later Gödel proved something that can sound contradictory if the distinction between a logic and a theory formulated within that logic is ignored. Consider a formal mathematical theory sufficiently strong to express elementary arithmetic, and suppose that its axioms can be effectively specified, so that there is a mechanical procedure for determining whether a given expression is an axiom.

Gödel showed, roughly speaking, that if such a theory is consistent, there will be statements expressible in its language that the theory can neither prove nor disprove. The first incompleteness theorem therefore says, in simplified form, that for any consistent, effectively axiomatized formal theory strong enough to express elementary arithmetic, there are sentences that the theory cannot decide.

There will be a sentence G such that, under the relevant assumptions,

T ⊬ G

and

T ⊬ ¬G.

Read this as saying that the theory T proves neither G nor its negation. The theory is therefore incomplete in the technical sense that some sentence expressible in its language is neither provable nor refutable within the theory.

Gödel achieved this by discovering how arithmetic could, in effect, speak about its own formulas and proofs. Expressions and finite sequences of expressions were assigned numbers—what we now call Gödel numbers—so that claims about formulas, derivations, and provability could themselves be represented arithmetically. This made possible the construction of a sentence which, in a carefully defined sense, says of itself that it is not provable within the theory.

If the theory proved that sentence, the theory would thereby become inconsistent; yet if the theory is consistent, it cannot prove the sentence. The system therefore contains a statement that escapes its own power of demonstration, not because the rules of inference are defective, but because a sufficiently expressive formal theory cannot, under the relevant conditions, settle every sentence formulable within its own language.

Gödel's second incompleteness theorem deepens the point. A sufficiently strong consistent theory cannot, using only its own formal resources, prove its own consistency; thus the limits disclosed by incompleteness concern not merely this or that recalcitrant sentence, but also the capacity of a formal theory to certify from within itself the consistency upon which its deductive enterprise depends.

Why Completeness and Incompleteness Do Not Conflict

The apparent paradox disappears once we notice that Gödel's two results concern different objects. The completeness theorem concerns first-order logic itself and says that every semantic consequence at the level of first-order logical validity can be captured by formal proof, whereas the incompleteness theorem concerns particular formal theories formulated in languages sufficiently rich to express arithmetic and says that no suitably effective, consistent theory of the relevant strength can decide every sentence expressible within it.

First-order logic can therefore be complete as a logic even though particular first-order theories are incomplete as theories. Logic may provide entirely adequate rules for capturing logical consequence without thereby guaranteeing that a given axiomatic theory will settle every question formulable in its language, and failure to keep these two claims distinct has been responsible for a great deal of confusion in both popular and theological appropriations of Gödel.

What Might Theology Learn?

Gödel's theorem is frequently abused in theological argument. It does not prove that God exists, establish that theological truth transcends reason, show that every worldview must contain mysteries, or entail that because arithmetic is incomplete, systematic theology must be incomplete in Gödel's technical sense. Such conclusions trade upon analogy without first establishing that the formal conditions governing Gödel's results apply to theological systems in the required way.

The genuine theological lesson is subtler, for theology itself regularly identifies primitive concepts, formulates doctrinal commitments, draws distinctions among them, and asks what follows from what. Precisely for that reason, it has something to learn from Gödel about the difference between the rigor with which consequences are drawn and the adequacy or completeness of the theory from which they are drawn.

One may possess completely precise rules of reasoning without thereby possessing a theory capable of deciding every question formulable within the theory's language. The rigor of an inferential procedure and the completeness of a theory are therefore different achievements, and formal precision should never be confused with exhaustive conceptual capture.

This distinction matters particularly for philosophical theology because there is no need to oppose formal reasoning to mystery, as though careful logic were somehow hostile to theological depth, nor is there any warrant for supposing that once doctrines have been sufficiently formalized every further theological question becomes mechanically decidable. Formalization can clarify commitments, expose hidden assumptions, reveal inconsistency, and determine consequences; yet what a theory can express is not identical with what that theory can prove, and what follows rigorously from a set of assumptions does not by itself establish that those assumptions are sufficient for everything theology wishes to say.

The validity of an inference must therefore be distinguished from the adequacy of the theory within which the inference is made. A theological argument may be formally impeccable while the assumptions from which it proceeds remain too weak, too narrow, or otherwise insufficient to determine all that theologians wish to assert; conversely, expanding one's theological vocabulary or axiomatic commitments does not by itself guarantee that the resulting system will be more adequate unless one also asks what structures satisfy it and what consequences genuinely follow.

Gödel consequently belongs in theological education not because he supplies an apologetic shortcut, but because he teaches intellectual discipline. His work forces us to distinguish syntax from semantics, logic from theory, truth from proof, and the expressive resources of a language from the demonstrative resources of an axiomatic system; these are distinctions theology needs whenever it attempts to state with precision what it believes and what follows from those beliefs.

Those distinctions become still more important when we turn from Gödel to model theory, for the next question is unavoidable: even when a first-order theory has models, how tightly can its language determine what those models are like? The Löwenheim–Skolem results show that the answer is stranger than one might initially suppose, and with them the problem shifts from the limits of proof to the relation between a theory and the structures capable of satisfying it.

Bibliographical Note

Gödel's completeness theorem appeared in his 1930 dissertation and in the related publication “Die Vollständigkeit der Axiome des logischen Funktionenkalküls.” His incompleteness results appeared the following year in “Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I” (1931).

For philosophical orientation, the crucial distinction to preserve is between the completeness of first-order logical consequence and the incompleteness of sufficiently strong, effectively axiomatized formal theories. Standard introductions to mathematical logic and the philosophy of logic provide fuller treatments of both results, while Gödel's original papers remain models of mathematical economy and conceptual force.

When Logic Became Dangerous: Russell, Zermelo, and the Discipline of Totality

This is the second part of a series developed through the Department of Philosophical Theology at the Institute of Lutheran Theology's Christ School of Theology, exploring major results in modern logic and their significance for philosophical and systematic theology.

The great achievements of Frege, Peirce, and Cantor vastly enlarged the expressive resources available to logic and mathematics. Quantification made it possible to speak formally about all or some objects satisfying a condition; the logic of relations permitted systematic treatment of structures involving two or more objects; Cantor showed that infinity itself could be mathematically articulated and that infinite collections could differ in cardinality. Yet precisely this increase in expressive power produced a new problem, for once logic could speak about collections defined by conditions, what prevented us from forming a collection corresponding to any condition whatsoever?

The answer, discovered with particular force by Bertrand Russell, was contradiction.

Consider the apparently innocent idea of the collection of all collections that are not members of themselves. Let us call this collection R. We can describe it this way:

R = {x : x ∉ x}.

Read: R is the collection of all objects x such that x is not a member of itself.

Now ask whether R itself belongs to R. By the very condition defining R, we obtain:

R ∈ R if and only if R ∉ R.

Read: R is a member of itself if and only if R is not a member of itself.

Either answer produces its opposite. If R belongs to itself, then by definition it must not belong to itself; but if R does not belong to itself, then it satisfies the condition for membership in R and therefore does belong to itself.

This was not merely an amusing puzzle. Russell communicated the paradox to Frege in 1902 while the second volume of Frege's Grundgesetze der Arithmetik was in press, and Frege immediately recognized the seriousness of the difficulty. His project had aimed to show that arithmetic could be derived from logical principles, but the paradox exposed a defect in the assumptions governing the formation of extensions or classes. The new logical machinery had become powerful enough to undermine one of its own foundational constructions.

The philosophical lesson is easy to state but profound in its consequences: not every condition that can be expressed determines an object corresponding to that condition.

Suppose we can specify a condition F and say intelligibly what it would be for something to satisfy F. It does not follow merely from this that there exists an object consisting of all and only the things satisfying F, for the movement from a condition to a corresponding totality requires justification. This distinction between specification and object formation became one of the central lessons of twentieth-century logic.

Zermelo and Restricted Set Formation

One response came through Ernst Zermelo and the subsequent development of axiomatic set theory. Instead of assuming a general principle according to which every condition determines a set, Zermelo restricted the circumstances under which sets may be formed. One does not simply move from a condition F to “the set of all Fs”; rather, set formation proceeds according to specified axioms.

The dangerous principle can be expressed simply as:

For every condition F, form the set {x : Fx}.

Read: for any condition F whatsoever, there exists a set containing exactly those objects that satisfy F.

Russell's paradox showed that this principle cannot be accepted without restriction. Zermelo's alternative was more cautious: begin with a set already given, and then select from it those members satisfying a specified condition. Thus, given a set A, one may form:

{x ∈ A : Fx}.

Read: the set of those members x of A that satisfy the condition F.

The difference is crucial because one is no longer permitted to range freely over absolutely everything and then collect into a set whatever satisfies an arbitrary condition. Set formation takes place relative to sets already available within an axiomatic framework, so that the transition from a predicate to a set is controlled rather than automatic.

Russell and the Theory of Types

Russell pursued a different strategy through the theory of types. The underlying intuition was that certain forms of self-reference arise because expressions belonging to different logical levels have been allowed to interact indiscriminately. Individuals occupy one level; predicates of individuals another; predicates of predicates another still. On such an approach, a predicate should not simply be allowed to take itself as an argument.

The slogan is crude but useful: things of one logical type cannot simply be treated as things of every logical type. Russell's solution therefore imposes hierarchy where unrestricted logical construction had permitted self-application, and the point is not merely technical. Logical grammar itself must be disciplined if expressions are not to generate combinations that the theory cannot consistently sustain.

These developments suggest a distinction that remains philosophically important: expressibility is not the same thing as admissible predication, and admissible predication is not the same thing as objecthood. The fact that we can describe something does not yet show that the description determines a genuine object, nor does the grammatical availability of an expression settle the ontological commitments of a theory.

Why This Matters for Theology

The theological relevance is greater than it may first appear because theology regularly speaks in terms that invite totalization: all truths, all possibilities, everything God knows, everything God can do, the totality of creation, or even everything that is not God. Russell's paradox does not show that such expressions are illegitimate, but it does force a distinction between quantifying over things and reifying the domain of quantification into another thing.

Suppose, for example, that we say:

For every x, if x is a creature, then God knows x.

Symbolically:

∀x (Cx → Kgx).

The symbols are simply an abbreviated way of saying: for every object x, if x is a creature, then God knows x.

Nothing in that assertion requires there to be an additional object called the set of all creatures, for the quantifier may range over creatures without thereby packaging the domain over which it ranges into a further entity. The same point applies when theologians speak of divine omniscience. One may say:

For every truth p, God knows p.

That claim does not by itself commit us to the existence of a further object called the set of all truths. Similarly, one may say:

For every creature x, x depends upon God.

Again, nothing in the quantificational structure of the sentence requires that there be one further object called the totality of everything other than God. Quantification alone does not force reification.

The methodological lesson can therefore be stated compactly: quantification should not be confused with reification. To say something of every member of a domain is not yet to say that the domain itself exists as one additional member of one's ontology, and theology is especially susceptible to overlooking this distinction because its characteristic subject matter repeatedly calls forth universal expressions.

There is a deeper theological resonance as well. Christian theology has long had to distinguish between what can legitimately be said of God and what ontological assumptions may be smuggled in by the forms of language used to say it. Russell, Zermelo, and type theory remind us that grammatical or logical form may tempt us into constructing objects that our theory neither requires nor can consistently sustain.

The suspect inference has this form: we can specify what it is to be an F; therefore, there exists one object consisting of all Fs. Yet the first statement does not entail the second. To put the point more carefully, being able to determine of each object whether it is F does not entail the existence of a set containing all and only the Fs. That is precisely the gap Russell's paradox forces us to notice.

The foundational crisis thus yielded a constructive philosophical lesson. Modern logic had acquired enormous power through Fregean quantification and Cantorian set theory, but Russell's paradox demonstrated that expressive power requires discipline. Zermelo supplied axiomatic restrictions upon set formation, while Russell supplied logical hierarchy through types; both responses forced philosophers to distinguish more carefully among language, predication, collection, and existence.

For theology, these distinctions are invaluable precisely because theology regularly attempts to speak about the ultimate, the universal, and the all-encompassing. Whenever theology speaks about all, it should therefore ask a further question: have we merely quantified over everything in some domain, or have we quietly turned that domain into one more thing?The question matters whenever theology attempts to speak of God, creation, possibility, truth, or totality.

Bibliographical Note

The classic primary source for the paradox is Bertrand Russell's 1902 letter to Gottlob Frege, together with Frege's discussion in the appendix to the second volume of Grundgesetze der Arithmetik (1903). Russell developed the theory of types most fully with Alfred North Whitehead in Principia Mathematica (1910–1913). Ernst Zermelo's “Untersuchungen über die Grundlagen der Mengenlehre I” (1908) provided the first major axiomatization of set theory designed in part to avoid the paradoxes generated by unrestricted set formation. For historical orientation, Jean van Heijenoort's From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931 remains invaluable.