# GetWiki

### first-order logic

ARTICLE SUBJECTS
news  →
unix  →
wiki  →
ARTICLE TYPES
feed  →
help  →
wiki  →
ARTICLE ORIGINS first-order logic
[ temporary import ]
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
{{Redirect|Predicate logic|logics admitting predicate or function variables|Higher-order logic}}{{short description|Collection of formal systems used in mathematics, philosophy, linguistics, and computer science}}First-order logicâ€”also known as predicate logic and first-order predicate calculusâ€”is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects and allows the use of sentences that contain variables, so that rather than propositions such as Socrates is a man one can have expressions in the form "there exists x such that x is Socrates and x is a man" and there exists is a quantifier while x is a variable.Hodgson, Dr. J. P. E., "First Order Logic", Saint Joseph's University, Philadelphia, 1995. This distinguishes it from propositional logic, which does not use quantifiers or relations;Hughes, G. E., & Cresswell, M. J., A New Introduction to Modal Logic (London: Routledge, 1996), p.161. in this sense, propositional logic is the foundation of first-order logic.A theory about a topic is usually a first-order logic together with a specified domain of discourse over which the quantified variables range, finitely many functions from that domain to itself, finitely many predicates defined on that domain, and a set of axioms believed to hold for those things. Sometimes "theory" is understood in a more formal sense, which is just a set of sentences in first-order logic.The adjective "first-order" distinguishes first-order logic from higher-order logic in which there are predicates having predicates or functions as arguments, or in which one or both of predicate quantifiers or function quantifiers are permitted.BOOK, Mendelson, Elliott, Introduction to Mathematical Logic, 1964, Van Nostrand Reinhold, 56, In first-order theories, predicates are often associated with sets. In interpreted higher-order theories, predicates may be interpreted as sets of sets.There are many deductive systems for first-order logic which are both sound (all provable statements are true in all models) and complete (all statements which are true in all models are provable). Although the logical consequence relation is only semidecidable, much progress has been made in automated theorem proving in first-order logic. First-order logic also satisfies several metalogical theorems that make it amenable to analysis in proof theory, such as the LÃ¶wenheimâ€“Skolem theorem and the compactness theorem.First-order logic is the standard for the formalization of mathematics into axioms and is studied in the foundations of mathematics.Peano arithmetic and Zermeloâ€“Fraenkel set theory are axiomatizations of number theory and set theory, respectively, into first-order logic.No first-order theory, however, has the strength to uniquely describe a structure with an infinite domain, such as the natural numbers or the real line. Axiom systems that do fully describe these two structures (that is, categorical axiom systems) can be obtained in stronger logics such as second-order logic.The foundations of first-order logic were developed independently by Gottlob Frege and Charles Sanders Peirce.Eric M. Hammer: Semantics for Existential Graphs, Journal of Philosophical Logic, Volume 27, Issue 5 (October 1998), page 489: "Development of first-order logic independently of Frege, anticipating prenex and Skolem normal forms" For a history of first-order logic and how it came to dominate formal logic, see JosÃ© FerreirÃ³s (2001).

## Introduction

While propositional logic deals with simple declarative propositions, first-order logic additionally covers predicates and quantification.A predicate takes an entity or entities in the domain of discourse as input while outputs are either True or False. Consider the two sentences "Socrates is a philosopher" and "Plato is a philosopher". In propositional logic, these sentences are viewed as being unrelated and might be denoted, for example, by variables such as p and q. The predicate "is a philosopher" occurs in both sentences, which have a common structure of "a is a philosopher". The variable a is instantiated as "Socrates" in the first sentence and is instantiated as "Plato" in the second sentence. While first-order logic allows for the use of predicates, such as "is a philosopher" in this example, propositional logic does not.Goertzel, B., Geisweiller, N., Coelho, L., JaniÄiÄ‡, P., & Pennachin, C., Real-World Reasoning: Toward Scalable, Uncertain Spatiotemporal, Contextual and Causal Inference (Amsterdam & Paris: Atlantis Press, 2011), p. 29.Relationships between predicates can be stated using logical connectives. Consider, for example, the first-order formula "if a is a philosopher, then a is a scholar". This formula is a conditional statement with "a is a philosopher" as its hypothesis and "a is a scholar" as its conclusion. The truth of this formula depends on which object is denoted by a, and on the interpretations of the predicates "is a philosopher" and "is a scholar".Quantifiers can be applied to variables in a formula. The variable a in the previous formula can be universally quantified, for instance, with the first-order sentence "For every a, if a is a philosopher, then a is a scholar". The universal quantifier "for every" in this sentence expresses the idea that the claim "if a is a philosopher, then a is a scholar" holds for all choices of a.The negation of the sentence "For every a, if a is a philosopher, then a is a scholar" is logically equivalent to the sentence "There exists a such that a is a philosopher and a is not a scholar". The existential quantifier "there exists" expresses the idea that the claim "a is a philosopher and a is not a scholar" holds for some choice of a.The predicates "is a philosopher" and "is a scholar" each take a single variable. In general, predicates can take several variables. In the first-order sentence "Socrates is the teacher of Plato", the predicate "is the teacher of" takes two variables.An interpretation (or model) of a first-order formula specifies what each predicate means and the entities that can instantiate the variables. These entities form the domain of discourse or universe, which is usually required to be a nonempty set. For example, in an interpretation with the domain of discourse consisting of all human beings and the predicate "is a philosopher" understood as "was the author of the Republic", the sentence "There exists a such that a is a philosopher" is seen as being true, as witnessed by Plato.

## Syntax

There are two key parts of first-order logic. The syntax determines which collections of symbols are legal expressions in first-order logic, while the semantics determine the meanings behind these expressions.

### Alphabet

Unlike natural languages, such as English, the language of first-order logic is completely formal, so that it can be mechanically determined whether a given expression is legal. There are two key types of legal expressions: terms, which intuitively represent objects, and formulas, which intuitively express predicates that can be true or false. The terms and formulas of first-order logic are strings of symbols, where all the symbols together form the alphabet of the language. As with all formal languages, the nature of the symbols themselves is outside the scope of formal logic; they are often regarded simply as letters and punctuation symbols.It is common to divide the symbols of the alphabet into logical symbols, which always have the same meaning, and non-logical symbols, whose meaning varies by interpretation. For example, the logical symbol land always represents "and"; it is never interpreted as "or". On the other hand, a non-logical predicate symbol such as Phil(x) could be interpreted to mean "x is a philosopher", "x is a man named Philip", or any other unary predicate, depending on the interpretation at hand.

#### Logical symbols

There are several logical symbols in the alphabet, which vary by author but usually include:
• The quantifier symbols âˆ€ and âˆƒ
• The logical connectives: âˆ§ for conjunction, âˆ¨ for disjunction, â†’ for implication, â†” for biconditional, Â¬ for negation. Occasionally other logical connective symbols are included. Some authors use Cpq, instead of â†’, and Epq, instead of â†”, especially in contexts where â†’ is used for other purposes. Moreover, the horseshoe âŠƒ may replace â†’; the triple-bar â‰¡ may replace â†”; a tilde (~), Np, or Fpq, may replace Â¬; ||, or Apq may replace âˆ¨; and &, Kpq, or the middle dot, â‹…, may replace âˆ§, especially if these symbols are not available for technical reasons. (Note: the aforementioned symbols Cpq, Epq, Np, Apq, and Kpq are used in Polish notation.)
• Parentheses, brackets, and other punctuation symbols. The choice of such symbols varies depending on context.
• An infinite set of variables, often denoted by lowercase letters at the end of the alphabet x, y, z, ... . Subscripts are often used to distinguish variables: {{nowrap|1= x0, x1, x2, ... .}}
• An equality symbol (sometimes, identity symbol) =; see the section on equality below.
Not all of these symbols are requiredâ€“only one of the quantifiers, negation and conjunction, variables, brackets and equality suffice. There are numerous minor variations that may define additional logical symbols:
• Sometimes the truth constants T, Vpq, or âŠ¤, for "true" and F, Opq, or âŠ¥, for "false" are included. Without any such logical operators of valence 0, these two constants can only be expressed using quantifiers.
• Sometimes additional logical connectives are included, such as the Sheffer stroke, Dpq (NAND), and exclusive or, Jpq.

#### Non-logical symbols

The non-logical symbols represent predicates (relations), functions and constants on the domain of discourse. It used to be standard practice to use a fixed, infinite set of non-logical symbols for all purposes. A more recent practice is to use different non-logical symbols according to the application one has in mind. Therefore, it has become necessary to name the set of all non-logical symbols used in a particular application. This choice is made via a signature.The word language is sometimes used as a synonym for signature, but this can be confusing because "language" can also refer to the set of formulas.The traditional approach is to have only one, infinite, set of non-logical symbols (one signature) for all applications. Consequently, under the traditional approach there is only one language of first-order logic.More precisely, there is only one language of each variant of one-sorted first-order logic: with or without equality, with or without functions, with or without propositional variables, .... This approach is still common, especially in philosophically oriented books.
1. For every integer n â‰¥ 0 there is a collection of n-ary, or n-place, predicate symbols. Because they represent relations between n elements, they are also called relation symbols. For each arity n we have an infinite supply of them:
2. :P'n0, P'n1, P'n2, P'n3, ...
3. For every integer n â‰¥ 0 there are infinitely many n-ary function symbols:
4. :f n0, f n1, f n2, f n3, ...
In contemporary mathematical logic, the signature varies by application. Typical signatures in mathematics are {1, Ã—} or just {Ã—} for groups, or {0, 1, +, Ã—,

- content above as imported from Wikipedia
- "first-order logic" does not exist on GetWiki (yet)
- time: 12:21am EDT - Thu, Sep 19 2019
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 09 JUL 2019
Eastern Philosophy
History of Philosophy
GETWIKI 09 MAY 2016
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
GETWIKI 20 AUG 2014
GETWIKI 19 AUG 2014