This action might not be possible to undo. Are you sure you want to continue?

BooksAudiobooksComicsSheet Music### Categories

### Categories

### Categories

### Publishers

Scribd Selects Books

Hand-picked favorites from

our editors

our editors

Scribd Selects Audiobooks

Hand-picked favorites from

our editors

our editors

Scribd Selects Comics

Hand-picked favorites from

our editors

our editors

Scribd Selects Sheet Music

Hand-picked favorites from

our editors

our editors

Top Books

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Audiobooks

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Comics

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Sheet Music

What's trending, bestsellers,

award-winners & more

award-winners & more

P. 1

Computability and Logic Maravilhoso|Views: 89|Likes: 1

Published by carvalhoz

See more

See less

https://www.scribd.com/doc/101955846/Computability-and-Logic-Maravilhoso

11/17/2013

text

original

Let* n ∈* N be a natural number and* X* be a set. An* n*-tuple of elements of

*X* is a ﬁnite sequence

*x* = (*x*1*,x*2*,...,x*n)

where* x*1*,x*2*,...,x*n* ∈ X*. The set of all* n*-tuples of elements of* X* is denoted

by* X*n

. More generally, if* X*1*,X*2*,...,X*n are sets then the cartesian prod-

uct* X*1*×X*2*×...×X*n is the set of all* n*-tuples (*x*1*,x*2*,...,x*n with* x*1* ∈ X*1,

*x*2* ∈ X*2,* ...*,* x*n* ∈ X*n:

*X*1*×X*2*×...×X*n =* {*(*x*1*,x*2*,...,x*n) :* x*i* ∈ X*i for* i* = 1*,*2*,...,n}.
*

Thus

*X*n

=* X ×X ×...×X
*

n

The Cartesian product is also called the direct product by some authors.

Let* X* be a set. A subset* R ⊂ X*n

is called an* n*-ary relation 21

unary

means 1-ary, binary means 2-ary, ternary means 3-ary. (The word “rela-

tion” unmodiﬁed usually means “binary relation”.) In some contexts it is

customary to write* R*(*x*1*,x*2*,...,x*n) rather than (*x*1*,x*2*,...,x*n)* ∈ R*.

Similarly, a function* f* :* X*n

*−→ Y* is sometimes called an* n*-ary function.

When* X* =* Y* the word* operation* is often used in place of the word function;

thus a unary operation on a set* X* is a function with domain and codomain

*X*, a binary operation on* X* is a function with domain* X*2

and codomain

*X*, a ternary operation on* X* is a function with domain* X*3

and codomain

*X*, etc..

Given a function* f* :* X*1* × X*2* × ... × X*n* −→ Y* it is customary to

denote the value of* f* for argument (*x*1*, x*2*,...,x*n) by* f*(*x*1*, x*2*,...,x*n) rather

than* f*((*x*1*, x*2*,...,x*n)). More generally, one often tacitly omits or inserts

parantheses to promote legibility.

Sometimes the value of a function or relation for given arguments is de-

noted in other ways. For example, we write* x* +* y* rather than +(*x,y*) (+

is really a binary function) and* x < y* rather than* <* (*x,y*) (*<* is really a

binary relation). Here, parentheses play the crucial role of indicating the

order in which the operations are performed (*x−*(*y* +*z*)* *= (*x−y*)+*z*) and

21

Logicians would say that a predicate denotes a relation in the same way that a numeral

denotes a number.

158

when parentheses are omitted this order is determined according to some em

convention (e.g.* x−y* +* z* means (*x−y*) +* z* and not* x−*(*y* +* z*)).

The notation where the name of a binary function is placed between

(rather than in front of) the arguments is called inﬁx notation. Occassion-

ally, the name of the function is placed after the operation – one writes (*x,y*)*f
*

rather than* f*(*x,y*) – this is called postﬁx notation. The notation* f*(*x,y*)

is thus called preﬁx notation. It is possible to omit parantheses unambigu-

ously when using postﬁx (or preﬁx notation) and some calculators (e.g. those

made by Hewlett-Packard) and programming languages (e.g. APL) do this.

(Thus* x−y* +* z* is denoted* xy−z*+ in postﬁx notation.) 22

Given a subset* A ⊂ X* the function

*χ*A :* X −→ {*0*,*1*}
*

deﬁned by

*χ*A(*x*) =

1 if* x ∈ A
*0 if

is called the characteristic function of* A* in* X*. (Some authors call it the

*indicator function*.)

Given a function* f* :* X −→ Y* the graph of* f* is the set of all pairs

(*x,f*(*x*)) with* x ∈ X*:

*graph*(*f*) =* {*(*x,y*)* ∈ X ×Y* :* y* =* f*(*x*)*}.
*

Remark 5.4.1* Let G ⊂ X×Y. Then there is a function f* :* X −→ Y such
*

*that G* =* graph*(*f*)* if and only for every x ∈ X there exists a unique y ∈ Y
*

*with* (*x,y*)* ∈ G. Moreover, given f*1*,f*2 :* X −→ Y we have that f*1 =* f*2* if
*

*and only if graph*(*f*1) =* graph*(*f*2)*.
*

The remark is obvious. When* G* =* graph*(*f*) the unique* y ∈ Y* such that

(*x,y*)* ∈ G* is* f*(*x*) and conversely given* G* and* x ∈ X* we may deﬁne* f*(*x*) to

be the unique* y ∈ Y* such that* x ∈ X*. Because of this remark, some authors

identify functions with their graphs, thereby reducing the number of kinds

of mathematical objects from three (individuals, sets, and functions) to two

(individuals and sets).

22

The observation that parantheses are not needed with preﬁx (or postﬁx) notation is

due to a Pole named Lukasiewicz so parentheses-free notation is sometimes called Polish

(or reverse Polish) notation.

159

Beinstein_convergencias e Declinio Do Capitalismo

BAKHTIN, M. Marxismo e Filosofia Da Linguagem

FÍSICA QUÂNTICA E BUDISMO

A dívida e a diferença reflexões sobre a reciprocidade

Teoria algorítmica da vida

Encantamento Do Virtual

Entire and Meromorphic Functions

0821803778_Analysis

Complex

biologia computacional

Gram Tic Ada Multi Do

Deleuze e Proust o Eu

LE SENS DE LA DIFFÉRENCE chez Gilles Deleuze et Emanuel Lévinas

LE SENS DE LA DIFFÉRENCE chez Gilles Deleuze et Emanuel Lévinas

Armadilha_Conceitual

Física Quântica e Budismo Atualizado

The Logic of Transdisciplinarity (2)

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->