Deduction-preserving “recursive isomorphisms” between theories
نویسندگان
چکیده
منابع مشابه
Deduction-preserving "recursive Isomorphisms" between Theories by Marian Boykan Pour-el and Saul Kripke
Introduction. In this work we discuss recursive mappings between theories which preserve deducibility, negation and implication. Roughly, we prove that any two axiomatizable theories containing a small fragment of arithmetic—this can be stated precisely—are "isomorphic" by a primitive recursive function mapping sentences onto sentences which also preserves deducibility, negation and implication...
متن کاملRational Isomorphisms between K-theories and Cohomology Theories
The well known isomorphism relating the rational algebraic K-theory groups and the rational motivic cohomology groups of a smooth variety over a field of characteristic 0 is shown to be realized by a map (the “Segre map”) of infinite loop spaces. Moreover, the associated Chern character map on rational homotopy groups is shown to be a ring isomorphism. A technique is introduced which establishe...
متن کاملIsomorphisms Preserving Invariants
Let V and W be finite dimensional real vector spaces and let G ⊂ GL(V ) and H ⊂ GL(W ) be finite subgroups. Assume for simplicity that the actions contain no reflections. Let Y and Z denote the real algebraic varieties corresponding to R[V ] and R[W ] , respectively. If V and W are quasi-isomorphic, i.e., if there is a linear isomorphism L : V → W such that L sends G-orbits to H-orbits and L se...
متن کاملC∗-Isomorphisms, Jordan Isomorphisms, and Numerical Range Preserving Maps
Let V = B(H) or S(H), where B(H) is the algebra of bounded linear operator acting on the Hilbert space H, and S(H) is the set of self-adjoint operators in B(H). Denote the numerical range of A ∈ B(H) by W (A) = {(Ax, x) : x ∈ H, (x, x) = 1}. It is shown that a surjective map φ : V→ V satisfies W (AB +BA) =W (φ(A)φ(B) + φ(B)φ(A)) for all A,B ∈ V if and only if there is a unitary operator U ∈ B(H...
متن کاملEcological Partial Deduction : Preserving Characteristic
A partial deduction strategy for logic programs usually uses an abstraction operation to guarantee the niteness of the set of atoms for which partial deductions are produced. Finding an abstraction operation which guarantees niteness and does not loose relevant information is a diicult problem. In earlier work Gallagher and Bruynooghe proposed to base the abstraction operation on characteristic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1967
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1967-11689-6