Re: decidability and completeness

"Per Freem" <perfreem@xxxxxxxxx> writes:

> is it possible to have a language that can express theories that are
> not 1st order representable--meaning there's no 1st order logic theory
> such that it has exactly the same models as the theory--and still have
> the language be decidable?

What do you mean by a decidable language?
.

Relevant Pages

  • decidability and completeness
    ... is it possible to have a language that can express theories that are ... not 1st order representable--meaning there's no 1st order logic theory ... are all complete logics necessarily compact ... Prev by Date: ...
    (sci.logic)
  • Re: decidability and completeness
    ... >>> What do you mean by a decidable language? ... Prev by Date: ...
    (sci.logic)
  • Re: best method to perform operations on word lists
    ... current purpose it'll do the trick but any suggestion for optimization ... my $prev = 'nonesuch584685542256RANOM58544'; ... This didn't modify the list. ... hence my thoughts about language files. ...
    (comp.lang.perl.misc)
  • Re: Uncle Scrooge?
    ... (Is there any name that isn't the slang word for penis in some language ... Prev by Date: ...
    (alt.usage.english)
  • Re: Pseudocode in the wikipedia
    ... syntactical features of the language. ... Peace ... Bill Mill ... Prev by Date: ...
    (comp.lang.python)