Approximation theory of uniqueness conditions by existence conditions
The set of all indices of all functions provably recursive in any reasonable theory is shown to be recursively isomorphic to , where is -complete set.
We generalize to the case of arithmetical transfinite induction the following three theorems for PA: the Wainer Theorem, the Paris-Harrington Theorem, and a version of the Solovay-Ketonen Theorem. We give uniform proofs using combinatorial constructions.
It is very important to get the complete and timely information of urban road traffic incidents and then to make a reasonable strategy for police dispatching. By improving the efficiency of sending police, the loss of traffic incidents and the pressure of traffic police will be reduced greatly. An assistant decision model of police dispatching based on the information of automatic traffic incident detection is proposed in this paper. Firstly, an automatic traffic incident detection algorithm is...
We establish the following model-theoretic characterization of the fragment IΔ₀ + Exp + BΣ₁ of Peano arithmetic in terms of fixed points of automorphisms of models of bounded arithmetic (the fragment IΔ₀ of Peano arithmetic with induction limited to Δ₀-formulae). Theorem A. The following two conditions are equivalent for a countable model of the language of arithmetic: (a) satisfies IΔ₀ + BΣ₁ + Exp; (b) for some nontrivial automorphism j of an end extension of that satisfies IΔ₀. Here is the...