2016/06/12 by Joel David Hamkins, Hamkins, Joel David
Business, Management and Accounting · Computer Science · Psychology · #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge #Philosophy and Theoretical Science #Taxation and Legal Issues
paper · pdf · doi:10.48550/arxiv.1606.03778
openalex publication_date 2016/06/12 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28
The Vop venka principle, which asserts that every proper class of\nfirst-order structures in a common language admits an elementary embedding\nbetween two of its members, is not equivalent over GBC to the first-order\nVop venka scheme, which makes the Vop venka assertion only for the\nfirst-order definable classes of structures. Nevertheless, the two Vop venka\naxioms are equiconsistent and they have exactly the same first-order\nconsequences in the language of set theory. Specifically, GBC plus the\nVop venka principle is conservative over ZFC plus the Vop venka scheme for\nfirst-order assertions in the language of set theory.\n