Re: Existence, Self-identity and Uniqueness.



Hi

Owen wrote:
Jan Burse wrote:
Wrong again.
The introduction of "the x:Fx" does not render FOL= inconsistent at
all, unles you foolishly assume that non-referring descriptions are
values of the indidvidual variable.
I don't do that, why do you persist in doing that??

I was on purpose using some foolishly substitutions.
Someone has to do sometimes foolishly things to
show inconsistency, even in the precence of initially
innocent concepts.

I did this to show you that you are not strictly
working in FOL=. Because FOL= does not distinguish
between foolishly and non foolishly substitutions.

How do you bar foolishly substitutions from FOL=?
How do you control the following reasoning step,
which works in FOL= (even in FOL without =):

forall x A(x)
-------------
A(t)

Note again A is a formula. So we could also rewrite
the step as follows:

forall x A
----------
A[x/t]

Here A[x/t] denotes the result of substituting t for
x in the formula A. How do you control this, and still
claim you have FOL= at hand?

Bye

.



Relevant Pages

  • Re: Existence, Self-identity and Uniqueness.
    ... I was on purpose using some foolishly substitutions. ... Because FOL= does not distinguish ... How do you control the following reasoning step, ... forall x A ...
    (sci.logic)
  • Re: Existence, Self-identity and Uniqueness.
    ... In FOL a definition is simply modelled ... for a predicate symbol R as follows: ... reflexivity, i.e. forall x. ... The above proof needs reflexivity, ...
    (sci.logic)
  • Re: Existence, Self-identity and Uniqueness.
    ... forall x A0is true, ... valid inference in FOL=: ... The bothers would lead to the following ... The predicate is new, ...
    (sci.logic)
  • FOL Deduction Question
    ... Suddenly I found myself confused when thinking about FOL and Gentzen ... This sequent should be falsifiable, ... But using a standard G system for Classical FOL - with the duplication rules ... merged with Exists on right and Forall on left- the computation would ...
    (sci.logic)
  • FOL Deduction Question
    ... Suddenly I found myself confused when thinking about FOL and Gentzen ... This sequent should be falsifiable, ... But using a standard G system for Classical FOL - with the duplication rules ... merged with Exists on right and Forall on left- the computation would ...
    (comp.theory)