##
asymptotic

Overview page. Subjects: Computing — Philosophy.

A line is asymptotic to a curve if the distance between the line and the curve tends to zero as the distance along the curve tends to infinity.

##
Church's thesis

Overview page. Subjects: Philosophy — Computing.

The hypothesis, put forward by Alonzo Church in 1935, that any function on the natural numbers that can be computed by an algorithm can be defined by a formula of the lambda calculus. See...

##
completeness

Overview page. Subjects: Computing — Philosophy.

The property or state of being logically or mathematically complete. In logic, an inference procedure is complete if it can derive every possible valid conclusion from the given axioms. A...

##
computable function

Overview page. Subjects: Computing — Philosophy.

A function

*f* : *X* → *Y*

for which there exists an algorithm for evaluating *f*(*x*) for any element *x* in the domain *X* of *f*.

##
connective

Overview page. Subjects: Computing — Philosophy.

In formal logic a connective is an element of a sentence that joins parts in such a way that the logical properties of the whole are a defined function of the logical properties of the...

##
grammar

Overview page. Subjects: Computing — Philosophy.

The whole system and structure of a language or of languages in general, usually taken as consisting of syntax and morphology (including inflections) and sometimes also phonology and...

##
modal logic

Overview page. Subjects: Computing — Philosophy.

A logic studying the notions of necessity and possibility. Modal logic was of great importance historically, particularly in the light of various doctrines concerning the necessary...

##
ordered pair

Overview page. Subjects: Computing — Philosophy.

An ordered pair consists of two objects considered in a particular order. Thus, if *a ≠ b*, the ordered pair (*a*, *b*) is not the same as the ordered pair (*b*, *a*). See Cartesian product.

##
Polish notation

Overview page. Subjects: Philosophy — Computing.

A form of notation, invented by the Polish mathematician Jan Lukasiewicz, in which each operator precedes its operands, e.g.

*a* + *b* is expressed as +*ab*

##
symbolic logic

Overview page. Subjects: Computing — Philosophy.

The treatment of formal logic involving the setting up of a formalized language. The propositional calculus and predicate calculus are two of the more common areas of interest.