Syntax for Semantics: Krull’s Maximal Ideal Theorem

نویسندگان

چکیده

Abstract Krull’s Maximal Ideal Theorem (MIT) is one of the most prominent incarnations Axiom Choice (AC) in ring theory. For many a consequence AC, constructive counterparts are well within reach, provided attention turned to syntactical underpinning problem at hand. This viewpoints revised Hilbert Programme commutative algebra, which will here be carried out for MIT and several related classical principles.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Ideal Recursive Semantics for Defeasible Argumentation

In [1] a recursive warrant semantics for Defeasible Logic Programming extended with levels of possibilistic uncertainty for defeasible rules was introduced. The resulting argumentation framework, called RP-DeLP, is based on a general notion of collective (non-binary) conflict among arguments allowing to ensure direct and indirect consistency properties with respect to the strict knowledge. An o...

متن کامل

GENERALIZED PRINCIPAL IDEAL THEOREM FOR MODULES

The Generalized Principal Ideal Theorem is one of the cornerstones of dimension theory for Noetherian rings. For an R-module M, we identify certain submodules of M that play a role analogous to that of prime ideals in the ring R. Using this definition, we extend the Generalized Principal Ideal Theorem to modules.

متن کامل

The Grail theorem prover: Type theory for syntax and semantics

Type-logical grammars use a foundation of logic and type theory to model natural language. These grammars have been particularly successful giving an account of several well-known phenomena on the syntax-semantics interface, such as quantifier scope and its interaction with other phenomena. This chapter gives a highlevel description of a family of theorem provers designed for grammar developmen...

متن کامل

Reverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages

Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...

متن کامل

generalized principal ideal theorem for modules

the generalized principal ideal theorem is one of the cornerstones of dimension theory for noetherian rings. for an r-module m, we identify certain submodules of m that play a role analogous to that of prime ideals in the ring r. using this definition, we extend the generalized principal ideal theorem to modules.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logic, epistemology, and the unity of science

سال: 2021

ISSN: ['2214-9783', '2214-9775']

DOI: https://doi.org/10.1007/978-3-030-65824-3_6