Philosophy Forums
Forums Links Articles Gallery Chat
Style:


instantiation of EA formulas on finite domains
Can someone tell me if this is correct?

printPrint


Page: 1 2

instantiation of EA formulas on finite domains
Furrowed Brow 2
Aspirant

Usergroup: Members
Joined: Jan 05, 2008
Total Topics: 3
Total Posts: 33
Posted 03/23/08 - 01:09 AM:
quote post
#26
Thanks moonlight,

You are making me think about presentation. But whilst you mull over things keep in mind the predicate logic I am talking about is purely syntactic and gives the rules for combining signs. A predicate expression is not defined by a truth function, however it is defined by the way truth tables are constructed: the ordering produce by one operation upon another operation.

Also,

If the signs Fa are true, that is to say they correspond to some object that exists, the signs signify. If the object does not exist then the signs Fa fail to signify. So you can read signify and fails to signify as true and false. So the - minus sign is equivalent to the standard negating sign of propositional logic. However when we are dealing with predicate logic - which is being treated as a syntax - we need another negation sign to deny certain relationships hold between signs.

So -Fa says whilst the signs Fa are formed what they say is not true. The form of -Fa when we pick it apart is -Fx-a. And if -Fx-a is well formed then so is +Fx+a. That is the result of removing the all those truth possibilities and two rows from a truth table.

The curl before ~Fa says either -Fz+a or +Fx-a are the form. In effect the sign a cannot be the value of the variable.

FB
Download thread as

Page: 1 2



You don't have permission to post.

Please login or register.

Contact the Administration

Powered by WSN Forum

16 total queries
This page was created in 1.92 seconds
Memory used: 6202904 bytes
Server Status: time since last reboot is 111 days, 21:34, load average: 0.93, 1.50, 1.54