Why in first order logic theories are not possible a demonstration with infinite steps?
Since sentences (closed wff) are finitely formed.
I don´t understand your answer. Could it be you most widespread explanation? Sorry for my bad english. I think that transfinite steps in a proof are imposible, cause the induction rules uses one or two hypothesis only (modus ponens and introducing quantizer), but, what about non standard natural numbers from first order logic. Thanks anyway
So you meant why do syntactical proofs have finite steps and not infinite steps in their proof; well at some point you need to infer your conclusion, and this occurs after finite steps, otherwise you cannot construct a proof, since the conclusion is the last step in a proof, you cannot construct an infinite steps' proof, since there's no last step where you conclude your conclusion.
This should also work in non standard analysis.
Ok. But the problem I see is that demostration could have non standard steps, because for first order logic is impossible let she the non standard models of the a theory in first order language
No infinite step, only finite steps but infinity pases
It's hard to understand you, what do you mean by: infinity pases?
infinite steps, sorry. But I refer to a demostration in a number non standard natural numbers finite of steps
I recognize that English is not your native language, but frankly, what you have written is pretty much incomprehensible, especially "infinity pases" and "a number non standard natural numbers finite of steps". These make no sense.
Other way: why not a formal demostration in a non standard natural numbers steps?
I still don't get what you're asking. What do you mean by "non standard natural numbers steps"?
In the first order version of Peano axioms, there are the number to count real objects....1,2,3....but there are models for the PA theory in first order that contains non standard numbers that metamathematically are infinite, but in first order language are "finite". There is no way to free of non standard models to theories expressed in first order languages. If we work inside a first order theory, ¿how can we drop the non standards models, cause the adjective "non standard" is inexpressible in first order language theories formulates ?
Separate names with a comma.