What is first-order logic? - Definition from WhatIs.com

Definition

first-order logic

Part of the Computing fundamentals glossary:

First-order logic is symbolized reasoning in which each sentence, or statement, is broken down into a subject and a predicate. The predicate modifies or defines the properties of the subject. In first-order logic, a predicate can only refer to a single subject. First-order logic is also known as first-order predicate calculus or first-order functional calculus.

A sentence in first-order logic is written in the form Px or P(x), where P is the predicate and x is the subject, represented as a variable. Complete sentences are logically combined and manipulated according to the same rules as those used in Boolean algebra.

In first-order logic, a sentence can be structured using the universal quantifier (symbolized ) or the existential quantifier ( ). Consider a subject that is a variable represented by x. Let A be a predicate "is an apple," F be a predicate "is a fruit," S be a predicate "is sour"', and M be a predicate "is mushy." Then we can say

x : Ax Fx

which translates to "For all x, if x is an apple, then x is a fruit." We can also say such things as

x : Fx Ax

x : Ax Sx

x : Ax Mx

where the existential quantifier translates as "For some."

First-order logic can be useful in the creation of computer programs. It is also of interest to researchers in artificial intelligence ( AI ). There are more powerful forms of logic, but first-order logic is adequate for most everyday reasoning. The Incompleteness Theorem , proven in 1930, demonstrates that first-order logic is in general undecidable. That means there exist statements in this logic form that, under certain conditions, cannot be proven either true or false.

Also see Mathematical Symbols .

This was last updated in September 2005
Posted by: Margaret Rouse

Related Terms

Definitions

  • unique identifier (UID)

    - A unique identifier (UID) is a numeric or alphanumeric string that is associated with a single entity within a given system. (WhatIs.com)

  • cache memory

    - Cache memory, also called CPU memory, is random access memory (RAM) that a computer microprocessor can access more quickly than it can access regular RAM. (SearchStorage.com)

  • service-oriented architecture (SOA)

    - Service oriented architecture (SOA) is a technique that involves the interaction between loosely coupled services that function independently. (SearchSOA.com)

Glossaries

  • Computing fundamentals

    - Terms related to computer fundamentals, including computer hardware definitions and words and phrases about software, operating systems, peripherals and troubleshooting.

  • Internet applications

    - This WhatIs.com glossary contains terms related to Internet applications, including definitions about Software as a Service (SaaS) delivery models and words and phrases about web sites, e-commerce ...

Ask a Question. Find an Answer.Powered by ITKnowledgeExchange.com

Ask An IT Question

Get answers from your peers on your most technical challenges

Ask Question

Tech TalkComment

Share
Comments

    Results

    Contribute to the conversation

    All fields are required. Comments will appear at the bottom of the article.