# completeness theoremRecently Published Documents

264
(FIVE YEARS 23)

## H-INDEX

23
(FIVE YEARS 1)

2022 ◽
Author(s):
Saeide Zahiri ◽
Arsham Borumand Saeid
Keyword(s):

2021 ◽
Vol 6 (1) ◽
pp. 1-36
Author(s):
Oliver Board ◽
◽
Kim-Sau Chung ◽
Keyword(s):

This paper provides foundations for a model of unawareness, called object-based unawareness (OBU) structures, that can be used to distinguish between what an agent is unaware of and what she simply does not know. At an informal level, this distinction plays a key role in a number of papers such as Tirole (2009) and Chung & Fortnow (2016). In this paper, we give the model-theoretic description of OBU structures by showing how they assign truth conditions to every sentence of the formal language used. We then prove a model-theoretic sound and completeness theorem, which characterizes OBU structures in terms of a system of axioms. We then verify that agents in OBU structures do not violate any of the introspection axioms that are generally considered to be necessary conditions for a plausible notion of unawareness. Applications are provided in our companion paper.

2021 ◽
Author(s):
◽
Galym Akishev
Keyword(s):

<p>The object of study of the thesis is the notion of monadic bounded algebras (shortly, MBA's). These algebras are motivated by certain natural constructions in free (first-order) monadic logic and are related to free monadic logic in the same way as monadic algebras of P. Halmos to monadic logic (Chapter 1). Although MBA's come from logic, the present work is in algebra. Another important way of approaching MBA's is via bounded graphs, namely, the complex algebra of a bounded graph is an MBA and vice versa. The main results of Chapter 2 are two representation theorems: 1) every model is a basic MBA and every basic MBA is isomorphic to a model; 2) every MBA is isomorphic to a subdirect product of basic MBA's. As a consequence, every MBA is isomorphic to a subdirect product of models. This result is thought of as an algebraic version of semantical completeness theorem for free monadic logic. Chapter 3 entirely deals with MBA-varieties. It is proved by the method of filtration that every MBA-variety is generated by its finite special members. Using connections in terms of bounded morphisms among certain bounded graphs, it is shown that every MBA-variety is generated by at most three special (not necessarily finite) MBA's. After that each MBA-variety is equationally characterized. Chapter 4 considers finitely generated MBA's. We prove that every finitely generated MBA is finite (an upper bound on the number of elements is provided) and that the number of elements of a free MBA on a finite set achieves its upper bound. Lastly, a procedure for constructing a free MBA on any finite set is given.</p>

2021 ◽
Author(s):
◽
Galym Akishev
Keyword(s):

<p>The object of study of the thesis is the notion of monadic bounded algebras (shortly, MBA's). These algebras are motivated by certain natural constructions in free (first-order) monadic logic and are related to free monadic logic in the same way as monadic algebras of P. Halmos to monadic logic (Chapter 1). Although MBA's come from logic, the present work is in algebra. Another important way of approaching MBA's is via bounded graphs, namely, the complex algebra of a bounded graph is an MBA and vice versa. The main results of Chapter 2 are two representation theorems: 1) every model is a basic MBA and every basic MBA is isomorphic to a model; 2) every MBA is isomorphic to a subdirect product of basic MBA's. As a consequence, every MBA is isomorphic to a subdirect product of models. This result is thought of as an algebraic version of semantical completeness theorem for free monadic logic. Chapter 3 entirely deals with MBA-varieties. It is proved by the method of filtration that every MBA-variety is generated by its finite special members. Using connections in terms of bounded morphisms among certain bounded graphs, it is shown that every MBA-variety is generated by at most three special (not necessarily finite) MBA's. After that each MBA-variety is equationally characterized. Chapter 4 considers finitely generated MBA's. We prove that every finitely generated MBA is finite (an upper bound on the number of elements is provided) and that the number of elements of a free MBA on a finite set achieves its upper bound. Lastly, a procedure for constructing a free MBA on any finite set is given.</p>

2021 ◽
pp. 1-18
Author(s):
Marc Bezem ◽
Thierry Coquand ◽
Peter Dybjer ◽
Martín Escardó
Keyword(s):

Abstract We give a syntax independent formulation of finitely presented generalized algebraic theories as initial objects in categories of categories with families (cwfs) with extra structure. To this end, we simultaneously define the notion of a presentation Σ of a generalized algebraic theory and the associated category CwFΣ of small cwfs with a Σ-structure and cwf-morphisms that preserve Σ-structure on the nose. Our definition refers to the purely semantic notion of uniform family of contexts, types, and terms in CwFΣ. Furthermore, we show how to syntactically construct an initial cwf with a Σ-structure. This result can be viewed as a generalization of Birkhoff’s completeness theorem for equational logic. It is obtained by extending Castellan, Clairambault, and Dybjer’s construction of an initial cwf. We provide examples of generalized algebraic theories for monoids, categories, categories with families, and categories with families with extra structure for some type formers of Martin-Löf type theory. The models of these are internal monoids, internal categories, and internal categories with families (with extra structure) in a small category with families. Finally, we show how to extend our definition to some generalized algebraic theories that are not finitely presented, such as the theory of contextual cwfs.

Author(s):
Janusz Czelakowski
Keyword(s):

AbstractAction theory may be regarded as a theoretical foundation of AI, because it provides in a logically coherent way the principles of performing actions by agents. But, more importantly, action theory offers a formal ontology mainly based on set-theoretic constructs. This ontology isolates various types of actions as structured entities: atomic, sequential, compound, ordered, situational actions etc., and it is a solid and non-removable foundation of any rational activity. The paper is mainly concerned with a bunch of issues centered around the notion of performability of actions. It seems that the problem of performability of actions, though of basic importance for purely practical applications, has not been investigated in the literature in a systematic way thus far. This work, being a companion to the book as reported (Czelakowski in Freedom and enforcement in action. Elements of formal action theory, Springer 2015), elaborates the theory of performability of actions based on relational models and formal constructs borrowed from formal lingusistics. The discussion of performability of actions is encapsulated in the form of a strict logical system "Equation missing". This system is semantically defined in terms of its intended models in which the role of actions of various types (atomic, sequential and compound ones) is accentuated. Since due to the nature of compound actions the system "Equation missing" is not finitary, other semantic variants of "Equation missing" are defined. The focus in on the system "Equation missing" of performability of finite compound actions. An adequate axiom system for "Equation missing" is defined. The strong completeness theorem is the central result. The role of the canonical model in the proof of the completeness theorem is highlighted. The relationship between performability of actions and dynamic logic is also discussed.

2021 ◽
Vol 109 (5-6) ◽
pp. 836-839
Author(s):
S. N. Tumanov
Keyword(s):

Author(s):
Heinz-Dieter Ebbinghaus ◽
Jörg Flum ◽
Wolfgang Thomas
Keyword(s):

2020 ◽
Vol 9 (1) ◽
pp. 38
Author(s):
Yaoshun Fu ◽
Wensheng Yu
Keyword(s):

The formalization of mathematics based on theorem prover becomes increasingly important in mathematics and computer science, and, particularly, formalizing fundamental mathematical theories becomes especially essential. In this paper, we describe the formalization in Coq of eight very representative completeness theorems of real numbers. These theorems include the Dedekind fundamental theorem, Supremum theorem, Monotone convergence theorem, Nested interval theorem, Finite cover theorem, Accumulation point theorem, Sequential compactness theorem, and Cauchy completeness theorem. We formalize the real number theory strictly following Landau’s Foundations of Analysis where the Dedekind fundamental theorem can be proved. We extend this system and complete the related notions and properties for finiteness and sequence. We prove these theorems in turn from Dedekind fundamental theorem, and finally prove the Dedekind fundamental theorem by the Cauchy completeness theorem. The full details of formal proof are checked by the proof assistant Coq, which embodies the characteristics of reliability and interactivity. This work can lay the foundation for many applications, especially in calculus and topology.

2020 ◽
pp. 108820
Author(s):
Sergey Tumanov
Keyword(s):