Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #167715 > unrolled thread
| Started by | peteolcott <peterolcott2@gmail.com> |
|---|---|
| First post | 2017-12-02 11:53 -0800 |
| Last post | 2017-12-04 14:17 +0000 |
| Articles | 8 on this page of 28 — 6 participants |
Back to article view | Back to sci.logic
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
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
Page 2 of 2 — ← Prev page 1 [2]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-12-05 16:43 +0000 |
| Message-ID | <p06ib0$ejc$1@news.albasani.net> |
| In reply to | #167823 |
Rupert wrote: > Well, that's all well and fine, but I don't understand that notation. Where can I read an explanation of how the notation works? > It looks like BNF, https://en.wikipedia.org/wiki/Backus%E2%80%93Naur_form. The pikiwedia article has ::= where Peter has : . -- 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
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-12-06 02:31 +0000 |
| Message-ID | <87mv2w37ve.fsf@bsb.me.uk> |
| In reply to | #167825 |
Peter Percival <peterxpercival@hotmail.com> writes: > Rupert wrote: > > >> Well, that's all well and fine, but I don't understand that >> notation. Where can I read an explanation of how the notation works? > > It looks like BNF, > https://en.wikipedia.org/wiki/Backus%E2%80%93Naur_form. The pikiwedia > article has ::= where Peter has : . It's YACC. The Linux implementation is called Bison. But, yes, it is essentially a machine-readable EBNF. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2017-12-05 12:00 -0600 |
| Message-ID | <-sKdnSWrgfxIQ7vHnZ2dnUU7-IPNnZ2d@giganews.com> |
| In reply to | #167823 |
On 12/5/2017 10:29 AM, Rupert wrote:
> On Tuesday, December 5, 2017 at 5:22:31 PM UTC+1, peteolcott wrote:
>> On Tuesday, December 5, 2017 at 10:05:43 AM UTC-6, Rupert wrote:
>>> On Tuesday, December 5, 2017 at 3:53:54 PM UTC+1, peteolcott wrote:
>>>> On Tuesday, December 5, 2017 at 4:16:51 AM UTC-6, Rupert wrote:
>>>>> On Monday, December 4, 2017 at 8:23:39 PM UTC+1, Pete Olcott wrote:
>>>>>> On 12/4/2017 12:46 PM, Rupert wrote:
>>>>>>
>>>>>>
>>>>>>
>>>>>> On Monday, December 4, 2017 at 7:15:45 PM UTC+1, Pete Olcott wrote:
>>>>>>
>>>>>>
>>>>>> On 12/4/2017 1:39 AM, Rupert wrote:
>>>>>>
>>>>>>
>>>>>>
>>>>>> On Monday, December 4, 2017 at 7:35:55 AM UTC+1, peteolcott wrote:
>>>>>>
>>>>>>
>>>>>> On Monday, December 4, 2017 at 12:16:39 AM UTC-6, Rupert wrote:
>>>>>>
>>>>>>
>>>>>> On Sunday, December 3, 2017 at 8:32:00 PM UTC+1, Pete Olcott wrote:
>>>>>>
>>>>>>
>>>>>> On 12/3/2017 1:23 PM, Rupert wrote:
>>>>>>
>>>>>>
>>>>>>
>>>>>> On Sunday, December 3, 2017 at 7:47:10 PM UTC+1, Pete Olcott wrote:
>>>>>>
>>>>>>
>>>>>> On 12/3/2017 12:09 PM, Rupert wrote:
>>>>>>
>>>>>>
>>>>>>
>>>>>> On Sunday, December 3, 2017 at 6:48:18 PM UTC+1, Pete Olcott wrote:
>>>>>>
>>>>>>
>>>>>> On 12/3/2017 10:48 AM, Rupert wrote:
>>>>>>
>>>>>>
>>>>>>
>>>>>> On Saturday, December 2, 2017 at 11:21:28 PM UTC+1, Pete Olcott wrote:
>>>>>>
>>>>>>
>>>>>> On 12/2/2017 3:23 PM, Peter Percival
>>>>>> wrote:
>>>>>>
>>>>>>
>>>>>> peteolcott
>>>>>> wrote:
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> All sound inference begins with a set of
>>>>>> finite string axioms and
>>>>>>
>>>>>>
>>>>>> through a specific set of finite string transformation rules
>>>>>>
>>>>>>
>>>>>> derives a finite string conclusion. This combines Aristotle
>>>>>> and
>>>>>>
>>>>>>
>>>>>> Hilbert.
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> To me, a sound inference is one that transmits truth from the
>>>>>> premises to the conclusion. Your account is very vague: what
>>>>>> axioms, what rules? Mine is also problematic: what is truth? (Of
>>>>>> course, I don't mean "mine" literally, I am just quoting what I
>>>>>> have learned.) Can you give relevant citations for Aristotle and
>>>>>> Hilbert?
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> Invalid reasoning (the whole set of
>>>>>> fallacies) is using any finite
>>>>>>
>>>>>>
>>>>>> string transformation rules that are not in the predefined
>>>>>> set.
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> There you go again, what set?
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> My intention is to shown that truth is consistently and
>>>>>> completely defined by a set of axioms.
>>>>>>
>>>>>> This post is a sketch of the outline of this proof, by
>>>>>> setting the foundational ground rules.
>>>>>>
>>>>>>
>>>>>>
>>>>>> Aristotle:
>>>>>>
>>>>>>
>>>>>> (1) True Premises
>>>>>>
>>>>>> (2) Valid Deductive Logical Inference
>>>>>>
>>>>>> (3) Sound Conclusion
>>>>>>
>>>>>>
>>>>>>
>>>>>> Interpreting
>>>>>> Aristotle in terms of Hilbert (© 2017 Pete Olcott)
>>>>>>
>>>>>> (1) Finite String Axioms // true premises
>>>>>>
>>>>>> (2) Predefined set of Finite String Transformation Rules // valid
>>>>>> inference
>>>>>>
>>>>>> (3) Correct Finite String Conclusion // sound conclusion
>>>>>>
>>>>>>
>>>>>>
>>>>>> http://liarparadox.org/index.php/2017/11/03/refuting-the-conclusion-of-godels-1931-incompleteness-theorem/
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> Copyright 2017 Pete Olcott
>>>>>>
>>>>>> --
>>>>>> Defining Tarski’s ∀x True(x) ↔ φ(x)
>>>>>> ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability
>>>>>> ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
>>>>>>
>>>>>>
>>>>>> Peter Olcott, from what you say here it would appear that you would like to give some kind of definition of truth. Truth in any particular language? First-order language of arithmetic?
>>>>>>
>>>>>>
>>>>>>
>>>>>> First Order Languages artificially
>>>>>> restrict their Relations to First Order objects. They cannot for
>>>>>> example express Relations between Relations.
>>>>>>
>>>>>>
>>>>>>
>>>>>> My own Minimal Type Theory is
>>>>>> almost identical to FOL except that it can express Relations
>>>>>> between (or among) any element of the set of
>>>>>> Things.
>>>>>>
>>>>>>
>>>>>>
>>>>>> https://philpapers.org/archive/PETMTT-4.pdf
>>>>>>
>>>>>> https://philpapers.org/archive/OLCPWM.pdf
>>>>>>
>>>>>>
>>>>>>
>>>>>> My definition of Truth is in my signature line:
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> --
>>>>>> Defining Tarski’s ∀x True(x) ↔ φ(x)
>>>>>> ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability
>>>>>> ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
>>>>>>
>>>>>>
>>>>>> Well, you didn't answer my question...
>>>>>>
>>>>>>
>>>>>> Maybe my answer was not direct enough:
>>>>>>
>>>>>>
>>>>>> Because you didn't answer. Yes, I know you think that's a definition of truth. Truth in which language? You didn't answer.
>>>>>>
>>>>>>
>>>>>>
>>>>>> For the third time now: Truth in
>>>>>> the language of Minimal Type Theory...
>>>>>>
>>>>>>
>>>>>> I clicked your first link. No definition of this language is given.
>>>>>>
>>>>>>
>>>>>> I have partial BNF on the first page of the second link.
>>>>>>
>>>>>> The actual BNF is totally complete, and I have a fully operational computer language compiler that translates these expression into directed acyclic graphs. I can't release the full BNF.
>>>>>>
>>>>>> The expressions that I am using now seem to be conventional second or third order logic. Thus their language is already defined.
>>>>>>
>>>>>> ∀x True(x) ↔ (∃Γ ⊆ SOL Provable(Γ, x))
>>>>>>
>>>>>>
>>>>>> You're talking about a second or third order language? What signature?
>>>>>>
>>>>>>
>>>>>>
>>>>>> I explained this in great depth in
>>>>>> my three part reply to Percival.
>>>>>>
>>>>>> I will sum it up here if you want additional details please see
>>>>>> my three part reply to Percival.
>>>>>>
>>>>>> This is the first time the I have
>>>>>> ever answered a question about the signature of a language thus
>>>>>> I am answering this question to some degree in terms of my
>>>>>> current understanding of the definition of the signature of a
>>>>>> function from computer science.
>>>>>>
>>>>>>
>>>>>>
>>>>>> The actual signature of the set of
>>>>>> languages that I am defining is specified by the syntax of
>>>>>> Minimal Type Theory. MTT provides the means for any WFF to be
>>>>>> assigned an alias name, and for any alias name to be
>>>>>> quantified. This provides the means for specifying expressions
>>>>>> of arbitrary finite order logic.
>>>>>>
>>>>>>
>>>>>>
>>>>>> It is very important to totally
>>>>>> understand the precise syntax and semantics of MTT alias names
>>>>>> because this key distinction is entirely different than the
>>>>>> infinite hierarchy of indirect reference that Tarski referred
>>>>>> to.
>>>>>>
>>>>>>
>>>>>>
>>>>>> Copyright 2017 Pete Olcott
>>>>>>
>>>>>>
>>>>>> --
>>>>>> Defining Tarski’s ∀x True(x) ↔ φ(x)
>>>>>> ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability
>>>>>> ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
>>>>>>
>>>>>>
>>>>>> You misunderstood what is meant by the signature of a language. It just means the set of non-logical symbols. You have not, anywhere in this thread, given a definition of the language of MTT.
>>>>>>
>>>>>>
>>>>>> I have not redundantly provided this
>>>>>> material directly in the thread, I provided much of it on the referenced
>>>>>> links.
>>>>>>
>>>>>>
>>>>>>
>>>>>> When someone asks me to define a
>>>>>> language I do not cut-and-paste a whole dictionary. I provide a
>>>>>> link to this dictionary.
>>>>>>
>>>>>>
>>>>>>
>>>>>> The set of MTT non-logical symbols (as you would already know) is an
>>>>>> infinite set. The syntax and semantics for defining this infinite
>>>>>> set was provided on the referenced links and augmented with further
>>>>>> explanation in this thread.
>>>>>>
>>>>>>
>>>>>>
>>>>>> These links will be updated to include these augmented
>>>>>> explanations:
>>>>>>
>>>>>> http://liarparadox.org/Minimal_Type_Theory.pdf
>>>>>>
>>>>>> http://liarparadox.org/Provability_with_Minimal_Type_Theory.pdf
>>>>>>
>>>>>>
>>>>>>
>>>>>> --
>>>>>> Defining Tarski’s ∀x True(x) ↔ φ(x)
>>>>>> ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability
>>>>>> ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
>>>>> Yes, I've read all that. There's no definition of what the language is. Do you understand what is involved in defining a language? First of all you need to define what the symbols are. What are the symbols?
>>>> This is what I count as a language definition, is this not what you count?
>>>> https://groups.google.com/d/msg/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ
>>>>
>>>> %token PREDICATE FUNCTION CONSTANT VARIABLE
>>>> %token IMPLIES AND OR IFF THERE_EXISTS FORALL
>>>> %left '='
>>>> %left VARIABLE
>>>> %left IMPLIES
>>>> %left IFF
>>>> %left AND
>>>> %left OR
>>>> %left NOT
>>>> %%
>>>>
>>>> sentence
>>>> : atomic_sentence
>>>> | sentence IMPLIES sentence
>>>> | sentence IFF sentence
>>>> | sentence AND sentence
>>>> | sentence OR sentence
>>>> | quantifier VARIABLE sentence
>>>> | '~' sentence %prec NOT
>>>> | '(' sentence ')'
>>>> ;
>>>> atomic_sentence
>>>> : PREDICATE '(' term_list ')'
>>>> | term '=' term
>>>> ;
>>>> term
>>>> : FUNCTION '(' term_list ')'
>>>> | CONSTANT
>>>> | VARIABLE
>>>> ;
>>>> term_list
>>>> : term_list term
>>>> | term
>>>> ;
>>>> quantifier
>>>> : THERE_EXISTS
>>>> | FORALL
>>>> ;
>>> I thought you said it was a second or third order language? Where are the second-order variables?
>> I am first getting mutual agreement on exactly what kind of language specification would be sufficient. The above is the complete language specification for first order predicate logic: FOPL.
>>
>> I stayed up until 1:00 AM working on redesigning my language specification for MTT such that MTT has absolute minimal divergence from the syntax of FOPL.
>>
>> MTT is an unlimited finite order of logic. The expression that I wrote only required 3rd order logic because it quantified over sets of relations. When implemented in MTT each one of these relations can be relations of relations of relations hundreds of levels deep.
> Well, that's all well and fine, but I don't understand that notation. Where can I read an explanation of how the notation works?
Percival is correct this is Backus Naur Form.
The references get quite involved for the simple explanation that is required.
*BNF is simply a recursive specification hierarchy.*
{sentence} at the top left is the root of the recursive specification tree.
All objects on the LHS are defined by the alternatives on their RHS.
The tree defines the syntax of any context free language. The list of tokens at the top of this specification define the words of this language, and thus the leaves of the parse tree.
For computer languages regular expression grammar defines the finite strings that comprise each individual token (word of the language).
--
Defining Tarski’s ∀x True(x) ↔ φ(x)
∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability
∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-12-05 16:39 +0000 |
| Message-ID | <p06i50$gfh$1@news.albasani.net> |
| In reply to | #167822 |
peteolcott wrote: > I am first getting mutual agreement on exactly what kind of language specification would be sufficient. The above is the complete language specification for first order predicate logic: FOPL. Look in Mendelson (section 2.1 in the 5th ed.): you need to specify what the constants are, what the predicate letters are and what the number of places of each is, and what the function letters are and what the number of places of each is. -- 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
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2017-12-05 12:19 -0600 |
| Message-ID | <ZJudnTKkfOSofrvHnZ2dnUU7-V-dnZ2d@giganews.com> |
| In reply to | #167824 |
On 12/5/2017 10:39 AM, Peter Percival wrote:
> peteolcott wrote:
>
>
>> I am first getting mutual agreement on exactly what kind of language specification would be sufficient. The above is the complete language specification for first order predicate logic: FOPL.
>
> Look in Mendelson (section 2.1 in the 5th ed.): you need to specify what the constants are, what the predicate letters are and what the number of places of each is, and what the function letters are and what the number of places of each is.
>
>
This will all be subsumed by defining an _IDENTIFIER with this regular expression:
D [0-9]
L [a-zA-Z_]
({L}|{UTF_8})+({L}|{D}|{UTF_8})* { count(); return _IDENTIFIER; }
_IDENTIFIER ∈ Constants
_IDENTIFIER ∈ Predicates
_IDENTIFIER ∈ Functions
Specifying the arguments to Predicates and Functions will have its own separate syntax. Square_Root("egg sandwich") will be rejected as type mismatch error.
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.
--
Defining Tarski’s ∀x True(x) ↔ φ(x)
∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability
∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-12-05 18:45 +0000 |
| Message-ID | <p06pg4$ugo$1@news.albasani.net> |
| In reply to | #167828 |
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
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-12-05 18:54 +0000 |
| Message-ID | <p06q24$t0n$1@news.albasani.net> |
| In reply to | #167829 |
Peter Percival wrote: > [...] Function are I meant 'Functions'. > *total*. See, if you wish, http://www.ai4fm.org/events/ko-meeting/matthew-lovert-logic-partial-functions.pdf, https://link.springer.com/chapter/10.1007/978-3-642-14203-1_18, http://www.sciencedirect.com/science/article/pii/0304397590900053, etc, etc. > I conclude that the syntax of MTT is *not* the syntax of FOL. > > -- 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
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-12-04 14:17 +0000 |
| Message-ID | <p03ld7$r5u$1@news.albasani.net> |
| In reply to | #167769 |
peteolcott wrote: > The expressions that I am using now seem to be conventional second or > third order logic. Thus their language is already defined. That it only seems and that it's something or something else doesn't look promising. But let's be positive and suppose that it's second order. There is more than one second order language. Which is yours? (If it turns out to be third order, a similar question arises.) Once the language is fixed, there are such questions as do you have comprehension axioms? -- 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
[toc] | [prev] | [standalone]
Page 2 of 2 — ← Prev page 1 [2]
Back to top | Article view | sci.logic
csiph-web