The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: at the background of logic
Replies: 5   Last Post: Jun 13, 2013 7:52 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 2,665
Registered: 6/29/07
at the background of logic
Posted: Jun 12, 2013 3:24 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

I think that all logical connectives, quantifiers and identity are
derivable from a simple semi-formal inference rule denoted by "|" to
represent "infers" and this is not to be confused with the Sheffer
stroke nor any known logical connective.

A| C can be taken to mean the "negation of A"

A,B| A can be taken to mean the "conjunction of A and B"

x| phi(x) can be taken to mean: for all x. phi(x)

x, phi(y)| phi(x) can be taken to mean: x=y

The idea is that with the first case we an arbitrary proposition C is
inferred from A, this can only be always true if A was False,
otherwise we cannot infer an "arbitrary" proposition from it.

Similarly with the second case A to be inferred from A,B then both of
those must be true.

Also with the third condition to infer that for some constant
predicate phi it is true that given x we infer phi(x) only happens if
phi(x) is true for All x.

With the fourth case for an 'arbitrary' predicate phi if phi(y) is
true and given x we infer that phi(x) is true, then x must be
identical to y.

Anyhow the above kind of inference is somewhat vague really, it needs
to be further scrutinized.


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.