Subdirect representations in axiomatic classes
نویسندگان
چکیده
منابع مشابه
Axiomatic Classes of Intuitionistic Models
A class of Kripke models for intuitionistic propositional logic is ‘axiomatic’ if it is the class of all models of some set of formulas (axioms). This paper discusses various structural characterisations of axiomatic classes in terms of closure under certain constructions, including images of bisimulations, disjoint unions, ultrapowers and ‘prime extensions’. The prime extension of a model is a...
متن کاملAxiomatic Constructor Classes in Isabelle/HOLCF
We have definitionally extended Isabelle/HOLCF to support axiomatic Haskell-style constructor classes. We have subsequently defined the functor and monad classes, together with their laws, and implemented state and resumption monad transformers as generic constructor class instances. This is a step towards our goal of giving modular denotational semantics for concurrent lazy functional programm...
متن کاملAxiomatic Theory of Algorithms: Computability and Decidability in Algorithmic Classes
Axiomatic approach has demonstrated its power in mathematics. The main goal of this paper is to show that axiomatic methods are also very efficient for computer science. It is possible to apply these methods to many problems in computer science. Here the main modes of computer functioning and program execution are described, formalized, and studied in an axiomatic context. The emphasis is on th...
متن کاملNullstellen and Subdirect Representation
David Hilbert’s solvability criterion for polynomial systems in n variables from the 1890s was linked by Emmy Noether in the 1920s to the decomposition of ideals in commutative rings, which in turn led Garret Birkhoff in the 1940s to his subdirect representation theorem for general algebras. The Hilbert-NoetherBirkhoff linkage was brought to light in the late 1990s in talks by Bill Lawvere. The...
متن کاملGame Representations of Complexity Classes
Many descriptive and computational complexity classes have game-theoretic representations. These can be used to study the relation between diierent logics and complexity classes in nite model theory. The notion of representing a property as a game is an old one. I claim that a given graph is connected, you deny it and demand that I connect a pair of vertices of your choice, etc. However, it is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1976
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-34-2-191-197