Search results for "COMPLETENESS"
showing 10 items of 66 documents
What is Mathematics: Gödel's Theorem and Around (Edition 2013)
2013
Hyper-textbook for students in mathematical logic and foundations of mathematics. Edition 2013. ATTENTION! New Edition 2015 available at https://dspace.lu.lv/dspace/handle/7/5306.
Modal Consequence Relations Extending S4.3: An Application of Projective Unification
2016
We characterize all finitary consequence relations over $\mathbf{S4.3}$ , both syntactically, by exhibiting so-called (admissible) passive rules that extend the given logic, and semantically, by providing suitable strongly adequate classes of algebras. This is achieved by applying an earlier result stating that a modal logic $L$ extending $\mathbf{S4}$ has projective unification if and only if $L$ contains $\mathbf{S4.3}$ . In particular, we show that these consequence relations enjoy the strong finite model property, and are finitely based. In this way, we extend the known results by Bull and Fine, from logics, to consequence relations. We also show that the lattice of consequence relation…
Multicenter solutions in Eddington-inspired Born-Infeld gravity
2020
We find multicenter (Majumdar-Papapetrou type) solutions of Eddington-inspired Born-Infeld gravity coupled to electromagnetic fields governed by a Born-Infeld-like Lagrangian. We construct the general solution for an arbitrary number of centers in equilibrium and then discuss the properties of their one-particle configurations, including the existence of bounces and the regularity (geodesic completeness) of these spacetimes. Our method can be used to construct multicenter solutions in other theories of gravity.
Protoalgebraicity and the Deduction Theorem
2001
This chapter is intended as an introduction to the Deduction Theorem and to applications of this theorem in metalogic.
On the Intrinsic Complexity of Learning
1995
AbstractA new view of learning is presented. The basis of this view is a natural notion of reduction. We prove completeness and relative difficulty results. An infinite hierarchy of intrinsically more and more difficult to learn concepts is presented. Our results indicate that the complexity notion captured by our new notion of reduction differs dramatically from the traditional studies of the complexity of the algorithms performing learning tasks.
Introduction to Mathematical Logic, Edition 2021
2021
Textbook for students in mathematical logic. First order languages. Axioms of constructive and classical logic. Proving formulas in propositional and predicate logic. Glivenko's theorem and constructive embedding. Axiom independence. Interpretations, models and completeness theorems. Normal forms. Tableaux and resolution methods. Herbrand's theorem. Sections 1, 2, 3 represent an extended translation of the corresponding chapters of the book: V. Detlovs, Elements of Mathematical Logic, Riga, University of Latvia, 1964, 252 pp. (in Latvian).
Some fixed point results for multi-valued mappings in partial metric spaces
2013
Abstract In this paper, we obtain some fixed point results for multi-valued mappings in partial metric spaces. Our results unify, generalize and complement various known comparable results from the current literature. An example is also included to illustrate the main result in the paper. MSC:46S40, 47H10, 54H25.
Closedness and lower semicontinuity of positive sesquilinear forms
2009
The relationship between the notion of closedness, lower semicontinuity and completeness (of a quotient) of the domain of a positive sesquilinear form defined on a subspace of a topological vector space is investigated and sufficient conditions for their equivalence are given.
Optimizing Query Perturbations to Enhance Shape Retrieval
2020
3D Shape retrieval algorithms use shape descriptors to identify shapes in a database that are the most similar to a given key shape, called the query. Many shape descriptors are known but none is perfect. Therefore, the common approach in building 3D Shape retrieval tools is to combine several descriptors with some fusion rule. This article proposes an orthogonal approach. The query is improved with a Genetic Algorithm. The latter makes evolve a population of perturbed copies of the query, called clones. The best clone is the closest to its closest shapes in the database, for a given shape descriptor. Experimental results show that improving the query also improves the precision and complet…
Introduction to Mathematical Logic (Edition 2017)
2017
Hyper-textbook for students in mathematical logic, Edition 2017