Re: Scott and George's Teaching Thread



On Aug 20, 4:08 pm, Scott <ToaTe...@xxxxxxxxx> wrote:
Okay, let's start with the basics. What kind of notation do you want
me to use

The important thing to remember here is that there are general
conventions. What I or anyone else may want is less relevant than
what is generally done (in the real world).
The important thing, locally, is that, as MoeBlee
already explained, the real world uses multiple fonts and faces.
We (by contrast) have to do something that will fit within the
keyboard/character-set constraints of this channel.

for the following:

Variables:

lower-case letters from the end of the alphabet (about t..z).

Functions:

This is a little premature; we are doing set theory, which will
have a SECOND definition of "function" as "a set of ordered pairs".
BEFORE that, the definition of a first-order LANGUAGE had
function-SYMBOLS that could have -arities of ANY natural number
(they take a list of arguments, and the length of the list is fixed
for each function-WITH-A-SYMBOL-BUILT-INTO-THE-LANGUAGE).
These also need to be lower-case letters.

Quantification:
Ax[whatever] and Ex[whatever].

This is also a keyboard-concession; in real life, the A would be
upside down and the E would be backwards.

Sets:
This doesn't even matter; we will have an axiomatic theory
for constructing sets, so sets are just going to be terms in the
language of
that theory. There will be some special sets that are usually denoted
with
capital letters, like N and O (the naturals and the empty set).
The axioms of the theory will require the existence of certain sets
that arguably ought to have functions naming the thing that must
exist. Many formulations of those axioms do in fact have such
names; the power-set axiom, for example, is often written as
defining p(x). LOWER-case p. It's a FUNCTION[-symbol].
The theory will also have a Union axiom whose result will need to
be written U(x) (upper-case U) to distinguish the symbol from
a smaller binary union operator or from u as a variable.

But again, because you were new, as I said the first day,
the questions were premature. You did not know to even ASK
how to represent
PREDICATES.
P(x,y,z) is usual and typical but Px is acceptable as an alias for
P(x). It generally improves readability to omit parentheses if all
your names really are one letter. Obviously, if you have longer
names then you will have to put the commas and parens back.

We can say more once you start writing first-order
sentences yourself.


.



Relevant Pages

  • Re: infinity
    ... >> Not while discussing the consequences of the axioms as they ... I commented that they were irrelevant to, and contradictory ... existed for over 2 millennia without needing any infinite naturals. ... A natural number is finite if the set of naturals less than or equal to ...
    (sci.math)
  • Re: Calculus XOR Probability
    ... The same axioms that give us transfinite set theory are needed to ... give us the naturals, and from them the other number systems on ... The invertible functions of IFR map reals to reals. ... infinite number. ...
    (sci.math)
  • Re: help with Godels
    ... Godel's theorem was about "recursive axiom-sets" ... Given any such set of axioms, ... this front may well require migrating to a different language. ... the standard model of the naturals. ...
    (sci.logic)
  • Re: Cantors circular "proof" that evens = integers
    ... That is NOT an obvious truth; it is not even a TRUE ... UNLESS YOUR AXIOMS PUT YOU in a UNIVERSE ... LOGICALLY EQUIVALENT to the Euclidean parallel postulate, ... there of naturals in toto DOES NOT MATTER. ...
    (sci.logic)
  • Re: How seriously do you take mathematics?
    ... >>> naturals as naturals, everywhere on the number line, that there are equal ... >>> Is it possible, as set theorists seem to believe, that an infinite ... > In an infinite binary tree, as you asserted, there ARE no terminal nodes, ... >>> When you look at this set of axioms from a purely logical ...
    (sci.math)