Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.logic > #167829

Re: Provability: ∃Γ ⊆ FS Provable(Γ, A)

From Peter Percival <peterxpercival@hotmail.com>
Newsgroups sci.logic, comp.lang.prolog, comp.ai.philosophy
Subject Re: Provability: ∃Γ ⊆ FS Provable(Γ, A)
Date 2017-12-05 18:45 +0000
Organization albasani.net
Message-ID <p06pg4$ugo$1@news.albasani.net> (permalink)
References (14 earlier) <9f7d6045-061d-4d41-bd85-bbaa0a382a2c@googlegroups.com> <5a618f7e-2511-4001-a612-e41678d3f31c@googlegroups.com> <9072b562-3dca-44bf-847c-be6c5a161a97@googlegroups.com> <p06i50$gfh$1@news.albasani.net> <ZJudnTKkfOSofrvHnZ2dnUU7-V-dnZ2d@giganews.com>

Cross-posted to 3 groups.

Show all headers | View raw


Pete Olcott wrote:

> Specifying the arguments to Predicates and Functions will have its
> own separate syntax. Square_Root("egg sandwich") will be rejected as
> type mismatch error.

If, in first order logic, 'Square_Root' is a one-place function letter
and '"egg sandwich"' is an individual constant, then 'Square_Root("egg
sandwich")' is a constant term and it denotes an individual.  If
'Square_Root' is a one-place predicate constant and '"egg sandwich"' is
an individual constant, then 'Square_Root("egg sandwich")' is a
sentence, though I suspect that you do not intend 'Square_Root' to be a
one-place predicate constant.  'Type mismatch error' is not something I
have come across in accounts of FOL: finite strings of symbols are
well-formed terms or formulae, or they are ill-formed.  Function are
*total*.

I conclude that the syntax of MTT is *not* the syntax of FOL.

> One of the huge changes to MTT will be that type specification may
> be optional in the same way that it is optional in FOPL, thus
> enabling MTT to evaluate FOPL expressions.

'Type specification', optional or otherwise, is not something I
have come across in accounts of FOL.

Are clp or cap folk interested in any of this?


>


-- 
Do, as a concession to my poor wits, Lord Darlington, just explain
to me what you really mean.
I think I had better not, Duchess.  Nowadays to be intelligible is
to be found out. -- Oscar Wilde, Lady Windermere's Fan

Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) peteolcott <peterolcott2@gmail.com> - 2017-12-02 11:53 -0800
  Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Peter Percival <peterxpercival@hotmail.com> - 2017-12-02 21:23 +0000
    Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Rupert <rupertmccallum@yahoo.com> - 2017-12-03 08:48 -0800
      Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Rupert <rupertmccallum@yahoo.com> - 2017-12-03 10:09 -0800
        Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Rupert <rupertmccallum@yahoo.com> - 2017-12-03 11:23 -0800
          Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Rupert <rupertmccallum@yahoo.com> - 2017-12-03 22:16 -0800
            Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) peteolcott <peterolcott2@gmail.com> - 2017-12-03 22:35 -0800
              Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Rupert <rupertmccallum@yahoo.com> - 2017-12-03 23:39 -0800
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Rupert <rupertmccallum@yahoo.com> - 2017-12-04 10:46 -0800
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Peter Percival <peterxpercival@hotmail.com> - 2017-12-04 21:15 +0000
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) peteolcott <peterolcott2@gmail.com> - 2017-12-04 13:54 -0800
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) peteolcott <peterolcott2@gmail.com> - 2017-12-04 19:10 -0800
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) peteolcott <peterolcott2@gmail.com> - 2017-12-04 14:26 -0800
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Rupert <rupertmccallum@yahoo.com> - 2017-12-05 02:16 -0800
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) peteolcott <peterolcott2@gmail.com> - 2017-12-05 06:53 -0800
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) peteolcott <peterolcott2@gmail.com> - 2017-12-05 07:42 -0800
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Jim Burns <james.g.burns@att.net> - 2017-12-05 12:31 -0500
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Rupert <rupertmccallum@yahoo.com> - 2017-12-05 08:05 -0800
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) peteolcott <peterolcott2@gmail.com> - 2017-12-05 08:22 -0800
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Rupert <rupertmccallum@yahoo.com> - 2017-12-05 08:29 -0800
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Peter Percival <peterxpercival@hotmail.com> - 2017-12-05 16:43 +0000
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-12-06 02:31 +0000
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Pete Olcott <Pete@NoEmail.address> - 2017-12-05 12:00 -0600
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Peter Percival <peterxpercival@hotmail.com> - 2017-12-05 16:39 +0000
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Pete Olcott <Pete@NoEmail.address> - 2017-12-05 12:19 -0600
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Peter Percival <peterxpercival@hotmail.com> - 2017-12-05 18:45 +0000
                Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Peter Percival <peterxpercival@hotmail.com> - 2017-12-05 18:54 +0000
              Re: Provability: ∃Γ ⊆ FS Provable(Γ, A) Peter Percival <peterxpercival@hotmail.com> - 2017-12-04 14:17 +0000

csiph-web