FACTOID # 21: The United States has the most money, airports, radios and Internet Service Providers.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

SEARCH ALL

FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > Logical predicate

In the jargon of the new mathematics of the 1960s, an open sentence is a sentence in which there are specific numbers which, when used to replace the variables, will allow the resulting expression to evaluate to true.


Mathematicians have not adopted that nomenclature, but refer instead to equations, inequalities with free variables, etc.


Such replacements are known as solutions to the sentence. An identity is an open sentence for which every number is a solution.


Examples of open sentences include:

  1. 3x − 9 = 21, whose only solution for x is 10;
  2. 4x + 3 > 9, whose solutions for x are all numbers greater than 3/2;
  3. x + y = 0, whose solutions for x and y are all pairs of numbers that are additive inverses;
  4. 3x + 9 = 3(x + 3), whose solutions for x are all numbers.

Example 4 is an identity. Examples 1, 3, and 4 are equations, while example 2 is an inequality.


Every open sentence must have (usually implicitly) a universe of discourse describing which numbers are under consideration as solutions. For instance, one might consider all real numbers or only integers. For example, in example 2 above, 3/2 is a solution if the universe of discourse is all real numbers, but not if the universe of discourse is only integers. In that case, only the integers greater than 3/2 are solutions: 2, 3, 4, and so on. On the other hand, if the universe of discourse consists of all complex numbers, then example 2 doesn't even make sense (although the other examples do). An identity is only required to hold for the numbers in its universe of discourse.


This same universe of discourse can be used to describe the solutions to the open sentence in symbolic logic using universal quantification. For example, the solution to example 2 above can be specified as:

For all x, 4x + 3 > 9 if and only if x > 3/2.

Here, the phrase "for all" implicitly requires a universe of discourse to specify which mathematical objects are "all" the possibilities for x.


The idea can even be generalised to situations where the variables don't refer to numbers at all, as in a functional equation. For example of this, consider

f * f = f,

which says that f(x) * f(x) = f(x) for every value of x. If the universe of discourse consists of all functions from the real line R to itself, then the solutions for f are all functions whose only values are one and zero. But if the universe of discourse consists of all continuous functions from R to itself, then the solutions for f are only the constant functions with value one or zero.



See also: atomic sentence, compound sentence.


  Results from FactBites:
 
Logic - Wikipedia, the free encyclopedia (3434 words)
The ambiguity is that "formal logic" is very often used with the alternate meaning of symbolic logic as we have defined it, with informal logic meaning any logical investigation that does not involve symbolic abstraction; it is this sense of 'formal' that is parallel to the received usages coming from "formal languages" or "formal theory".
The discovery of predicate logic is usually attributed to Gottlob Frege, who is also credited as one of the founders of analytical philosophy, but the formulation of predicate logic most often used today is the first-order logic presented in Principles of Theoretical Logic by David Hilbert and Wilhelm Ackermann in 1928.
The analytical generality of the predicate logic allowed the formalisation of mathematics, and drove the investigation of set theory, allowed the development of Alfred Tarski's approach to model theory; it is no exaggeration to say that it is the foundation of modern mathematical logic.
Predicate calculus - Wikipedia, the free encyclopedia (109 words)
In mathematical logic the predicate calculus, predicate logic or calculus of propositional functions is a formal system used to describe mathematical theories.
The predicate calculus is an extension of propositional calculus, which is inadequate for describing more complex mathematical structures.
A subject is a name for a member of a given group of individuals (a set) and a predicate is a relation on this group.
  More results at FactBites »


 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments
Please enter the 5-letter protection code

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms.