Logics for at most countable first-order structures
The authors present two extensions of infinitary probabilistic \(\omega\)-logic corresponding to most countable Archimedean and non-Archimedean structures. First, they provide Hilbert-type axiomatizations and prove the strong completeness for these two logics. This result enables to represent syntactically particular countable Archimedean and non-Archimedean structures such as the real closure of \(\mathbf Q\) and the Hardy field \(\mathbf Q(\varepsilon)\). This framework also provides strong completeness for several well-known systems, and possible applications are illustrated in the cases of non-monotonic reasoning reasoning and weight functions for neuro-symbolic computing. The developing of many-sorted variants of the introduced logics to formalize reasoning about subsets of elements of domains is proposed for the future work.
- A logic for reasoning about probabilities
- A logic with approximate conditional probabilities that can model default reasoning
- A probabilistic temporal epistemic logic: strong completeness
- Decidability and expressiveness for first-order logics of probability
- Editorial: Weighted logics for artificial intelligence -- an introductory discussion
- First order common knowledge logics
- Foundations of reasoning with uncertainty via real-valued logics
- From statistical relational to neurosymbolic artificial intelligence: a survey
- Geometric Rules in Infinitary Logic
- scientific article; zbMATH DE number 3154788 (Why is no real title available?)
- scientific article; zbMATH DE number 2046116 (Why is no real title available?)
- scientific article; zbMATH DE number 7015115 (Why is no real title available?)
- Kripke semantics for fuzzy logics
- Markov logic networks
- Metamathematics of fuzzy logic
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- Nonmonotonic reasoning, preferential models and cumulative logics
- On evaluations of propositional formulas in countable structures
- Probability logic
- Probability logics. Probability-based formalization of uncertain reasoning
- Some first-order probability logics
- Some probability logics with new types of probability operators
- The completeness of the first-order functional calculus
- The elementary theory of restricted analytic fields with exponentiation
- What does a conditional knowledge base entail?
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I.
This page was built for publication: Logics for at most countable first-order structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6867728)
