Universal variable non-Tarskian functors.
نویسندگان
چکیده
منابع مشابه
Non-additive Functors, Their Derived Functors, and the Suspension Homomorphism.
3E. L. Post, J. Symb. Logic, 12, 1-11, 1947. 4In the sense of Post, the word problem for Z is reducible to that for sp (2:). 5 W. Magnus, Math. Annalen, 106, 295-307, 1932. 6 DanaScott, abstract, J. Symb. Logic, 21, 111-112, 1956. 7Marshall Hall, J. Symb. Logic, 14, 115-118, 1949. 8 G. Higman, B. H. Neumann, and H. Neumann, J. London Math. Soc., 24, 247-254, 1949. 9 As defined, UG, Part I, p. 2...
متن کاملUniversal Arrows to Forgetful Functors from Categories of Topological Algebra
We survey the present trends in theory of universal arrows to forgetful functors from various categories of topological algebra and functional analysis to categories of topology and topological algebra. Among them are free topological groups, free locally convex spaces, free Banach-Lie algebras, and more. An accent is put on relationship of those constructions with other areas of mathematics an...
متن کاملOTTER Proofs in Tarskian Geometry
We report on a project to use OTTER to find proofs of the theorems in Tarskian geometry proved in Szmielew’s part (Part I) of [9]. These theorems start with fundamental properties of betweenness, and end with the development of geometric definitions of addition and multiplication that permit the representation of models of geometry as planes over Euclidean fields, or over real-closed fields in ...
متن کاملTarskian and Kripkean truth
A theory of the transfinite Tarskian hierarchy of languages is outlined and compared to a notion of partial truth by Kripke. It is shown that the hierarchy can be embedded into Kripke’s minimal fixed point model. From this results on the expressive power of both approaches are obtained.
متن کاملTarskian Set Constraints
We investigate set constraints over set expressions with Tarskian functional and relational operations. Unlike the Herbrand constructor symbols used in recent set constraint formalisms, the meaning of a Tarskian function symbol is interpreted in an arbitrary first order structure. We show that satisfiability of Tarskian set constraints is decidable in nondeterministic doubly exponential time. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1964
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093957883