**Author**: L. Henkin

**Publisher:** Springer

**ISBN:** 9783540387909

**Category:** Mathematics

**Page:** 323

**View:** 252

Skip to content
# Posts

Volume II completes the description of the main aspects of the theory, covering representation questions, model theory and decision problems for them, translations from logic to algebra and vice-versa, and relationships with other algebraic versions of logic.
Volume I provides a detailed analysis of cylindric algebras, starting with a formulation of their axioms and a development of their elementary properties, and proceeding to a deeper study of their interrelationships by means of general algebraic notions such as subalgebras, homomorphisms, direct products, free algebras, reducts and relativized algebras.
Algebraic logic is a subject in the interface between logic, algebra and geometry, it has strong connections with category theory and combinatorics. Tarski’s quest for finding structure in logic leads to cylindric-like algebras as studied in this book, they are among the main players in Tarskian algebraic logic. Cylindric algebra theory can be viewed in many ways: as an algebraic form of definability theory, as a study of higher-dimensional relations, as an enrichment of Boolean Algebra theory, or, as logic in geometric form (“cylindric” in the name refers to geometric aspects). Cylindric-like algebras have a wide range of applications, in, e.g., natural language theory, data-base theory, stochastics, and even in relativity theory. The present volume, consisting of 18 survey papers, intends to give an overview of the main achievements and new research directions in the past 30 years, since the publication of the Henkin-Monk-Tarski monographs. It is dedicated to the memory of Leon Henkin.
Relation algebras are algebras arising from the study of binary relations. They form a part of the field of algebraic logic, and have applications in proof theory, modal logic, and computer science. This research text uses combinatorial games to study the fundamental notion of representations of relation algebras. Games allow an intuitive and appealing approach to the subject, and permit substantial advances to be made. The book contains many new results and proofs not published elsewhere. It should be invaluable to graduate students and researchers interested in relation algebras and games. After an introduction describing the authors' perspective on the material, the text proper has six parts. The lengthy first part is devoted to background material, including the formal definitions of relation algebras, cylindric algebras, their basic properties, and some connections between them. Examples are given. Part 1 ends with a short survey of other work beyond the scope of the book. In part 2, games are introduced, and used to axiomatise various classes of algebras. Part 3 discusses approximations to representability, using bases, relation algebra reducts, and relativised representations. Part 4 presents some constructions of relation algebras, including Monk algebras and the 'rainbow construction', and uses them to show that various classes of representable algebras are non-finitely axiomatisable or even non-elementary. Part 5 shows that the representability problem for finite relation algebras is undecidable, and then in contrast proves some finite base property results. Part 6 contains a condensed summary of the book, and a list of problems. There are more than 400 exercises. The book is generally self-contained on relation algebras and on games, and introductory text is scattered throughout. Some familiarity with elementary aspects of first-order logic and set theory is assumed, though many of the definitions are given. Chapter 2 introduces the necessary universal algebra and model theory, and more specific model-theoretic ideas are explained as they arise.
This is an introduction to mathematical logic in which all the usual topics are presented: compactness and axiomatizability of semantical consequence, Löwenheim-Skolem-Tarski theorems, prenex and other normal forms, and characterizations of elementary classes with the help of ultraproducts. Logic is based exclusively on semantics: truth and satisfiability of formulas in structures are the basic notions. The methods are algebraic in the sense that notions such as homomorphisms and congruence relations are applied throughout in order to gain new insights. These concepts are developed and can be viewed as a first course on universal algebra. The approach to algorithms generating semantical consequences is algebraic as well: for equations in algebras, for propositional formulas, for open formulas of predicate logic, and for the formulas of quantifier logic. The structural description of logical consequence is a straightforward extension of that of equational consequence, as long as Boolean valued propositions and Boolean valued structures are considered; the reduction of the classical 2-valued case then depends on the Boolean prime ideal theorem.
This is a comprehensive book on the life and works of Leon Henkin (1921–2006), an extraordinary scientist and excellent teacher whose writings became influential right from the beginning of his career with his doctoral thesis on “The completeness of formal systems” under the direction of Alonzo Church. Upon the invitation of Alfred Tarski, Henkin joined the Group in Logic and the Methodology of Science in the Department of Mathematics at the University of California Berkeley in 1953. He stayed with the group until his retirement in 1991. This edited volume includes both foundational material and a logic perspective. Algebraic logic, model theory, type theory, completeness theorems, philosophical and foundational studies are among the topics covered, as well as mathematical education. The work discusses Henkin’s intellectual development, his relation to his predecessors and contemporaries and his impact on the recent development of mathematical logic. It offers a valuable reference work for researchers and students in the fields of philosophy, mathematics and computer science.
This book features more than 20 papers that celebrate the work of Hajnal Andréka and István Németi. It illustrates an interaction between developing and applying mathematical logic. The papers offer new results as well as surveys in areas influenced by these two outstanding researchers. They also provide details on the after-life of some of their initiatives. Computer science connects the papers in the first part of the book. The second part concentrates on algebraic logic. It features a range of papers that hint at the intricate many-way connections between logic, algebra, and geometry. The third part explores novel applications of logic in relativity theory, philosophy of logic, philosophy of physics and spacetime, and methodology of science. They include such exciting subjects as time travelling in emergent spacetime. The short autobiographies of Hajnal Andréka and István Németi at the end of the book describe an adventurous journey from electric engineering and Maxwell’s equations to a complex system of computer programs for designing Hungary’s electric power system, to exploring and contributing deep results to Tarskian algebraic logic as the deepest core theory of such questions, then on to applications of the results in such exciting new areas as relativity theory in order to rejuvenate logic itself.

Search and Download PDF eBook

**Author**: L. Henkin

**Publisher:** Springer

**ISBN:** 9783540387909

**Category:** Mathematics

**Page:** 323

**View:** 252

*In this chapter we discuss in detail the set-theoretically defined cylindric algebras and the relationships between them and the abstract cylindric algebras which were the focus of attention in Part I. The main notion in section 3.1 is ...*

**Author**: Bozzano G Luisa

**Publisher:** Elsevier

**ISBN:** 0080887589

**Category:** Mathematics

**Page:** 301

**View:** 413

*Volume I provides a detailed analysis of cylindric algebras, starting with a formulation of their axioms and a development of their elementary properties, and proceeding to a deeper study of their interrelationships by means of general ...*

**Author**: Leon Henkin

**Publisher:** North Holland

**ISBN:** UOM:39015017285068

**Category:** Mathematics

**Page:** 526

**View:** 473

*Dependence-Friendly Cylindric Set Algebras The meaning of a DFα formula φ in a structure A is a pair whose first coordinate is the set of winning teams for the formula, and whose second coordinate is the set of losing teams.*

**Author**: Hajnal Andréka

**Publisher:** Springer Science & Business Media

**ISBN:** 9783642350252

**Category:** Mathematics

**Page:** 474

**View:** 261

*A generalised cylindric set algebra of dimension O. is a subdirect product of cylindric set algebras of dimension O. 4. A cylindric algebra of dimension o is defined to be an algebra C = (C,0, 1, +, - Cisdij)ij<g obeying the following ...*

**Author**: Robin Hirsch

**Publisher:** Elsevier

**ISBN:** 0080540457

**Category:** Mathematics

**Page:** 710

**View:** 775

*The Representation Theorem for cylindric algebras ( in the sense above ) then states that each of them is iso- morphic to a subalgebra of a product of cylindric set algebras . Assume now that the language has been prepared such that ...*

**Author**: W Felscher

**Publisher:** CRC Press

**ISBN:** 905699266X

**Category:** Mathematics

**Page:** 298

**View:** 969

*3 Set Algebras The notion of a cylindric set algebra given in the introduction can be generalized as follows. An algebra A is a cylindric-relativized set algebra of dimension a iff there is a nonempty set U and a set V C “ U such that A ...*

**Author**: María Manzano

**Publisher:** Springer

**ISBN:** 9783319097190

**Category:** Mathematics

**Page:** 351

**View:** 840

*Introduction It is well - known that every Boolean algebra is representable , that is , it is isomorphic to a Boolean set algebra . However , the situation in the case of cylindric algebras is not parallel . Not every cylindric algebra ...*

**Author**: Diane Resek

**Publisher:**

**ISBN:** UCAL:C3511904

**Category:**

**Page:** 602

**View:** 960

*A cylindric set algebra A of dimension a is always a CA ; if it has base U , then it is also called a cylindric set algebra in the space u . If A = Sb SbU , then A is called a full cylindric set algebra . Definition 2.1.8 .*

**Author**: Don Leonard Pigozzi

**Publisher:**

**ISBN:** UCAL:C3477467

**Category:**

**Page:** 300

**View:** 507

*In §13.4 the algebra He(U) of all binary relations on a set U and the relativizations of its subalgebras are defined. ... for an arbitrary suitable structure 3, its canonical relativized cylindric set algebra Hc3. In §13.7, we construct ...*

**Author**: Judit Madarász

**Publisher:** Springer Nature

**ISBN:** 9783030641870

**Category:** Philosophy

**Page:** 517

**View:** 131

Privacy Policy

Copyright © 2023 PDF Download — Primer