Aspects of Definability, Ausgaben 2-3

arbitrary atomic formula automorphism axiom c(d+e Chapter complete consistent extension complete theory concepts consider constituent of depth Construction 5.1 cont Corollary countable decision problem definable in T(P definiens denoted depth d+e distributive normal form elements eliminability essential undecidability explicit definition explicitly definable extension of T(P first-order logic following are equivalent free variables function symbol game-theoretical semantics Hence Hintikka and Tuomela holds homogeneous f.u. individual constants isomorphic f.u. k-type kind left fixed Lemma many-sorted logic model theory model-theoretic monadic notion obtained omitted p-constituent P-positive and P-negative P)-decidable P)-undecidable partial automorphism predicate symbol Proof Rantala realized reduced u-type satisfies saturated f.u. semantical sense sentence sequence subconstituent subformula subtheory successor ordinal Suppose surface information syntactical Theorem theory T(P trivially inconsistent u-sequences uncertainty description uncertainty set uncertainty types urn model Vx(Px Vy(Py whence x₁