Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: model-completeness

Sortuj według:

Ogranicz wyniki do:

Decidability of addition and Frobenius map for polynomials and rational functions

Chompitaki Dimitra, Kamarianakis Manos, Pheidas Thanases

Reports on Mathematical Logic

2022

Vol. 57

53--60

Let p be a prime number, Fp a finite field with p elements, F an algebraic extension of Fp and z a variable. We consider the structure of addition and the Frobenius map (i.e., x 7→ x p ) in the polynomial rings F[z] and in fields F(z) of rational functions. We prove that any question about F[z] in the structure of addition and Frobenius map may be effectively reduced to questions about the similar structure of the field F. Furthermore, we provide an example which shows that a fact which is true for addition and the Frobenius map in the polynomial rings F[z] fails to be true in F(z). As a consequence, certain methods used to prove model completeness for polynomials do not suffice to prove model completeness for similar structures for fields of rational functions F(z), a problem that remains open even for F = Fp

A model-theoretic version of the complement theorem : applications

Nowak K.

Bulletin of the Polish Academy of Sciences. Mathematics

1999

Vol. 47, no 4

355-361

The paper treats of some consequences of the model-theoretic version of Gabrielov's complement theorem from [11], which asserts that the theories T[sub an] (introduced in [11] and T'[sub an] (defined herein) are model-complete. The theory T'[sub an] is a universal modification of T[sub an] in the language L'[sub an] of ordered rings expanded by the symbols of restricted analytic functions, arithmetic roots and multiplicative inverse l/x. We give a short proof of the curve selecting lemma, and next we demonstrate how quantifier elimination, within the structure R[sub an] expanded by multiplicative inverse 1/x (a result due to Denef-van den Dries [4], can be obtained from the complement theorem through a general method of logic. Also presented is an application to definability problems ; namely, a piecewise description of a subanalytic function by restricted analytic functions, arithmetic roots and l/x.

A model-theoretic version of the complement theorem

Nowak K.

Bulletin of the Polish Academy of Sciences. Mathematics

1999

Vol. 47, no 4

345-353

This paper deals with an axiomatic theory T[sub an] and the expansion R[sub an] of the ordered field of reals, formed by attaching the restricted analytic functions. We show that the theory T[sub an] is model-complete, which may be regarded as a version of Gabrielov's complement theorem. Our proof is based on Robinson's test and it does not involve a partition technique. An immediate corollary is that T[sub an] coincides with the semantic theory Th(R[sub an]) of all sentences true in the structure R[sub an].