Computability of validity and satisfiability in probability logics over finite and countable models

DOI10.1080/11663081.2016.1139967zbMath1398.03106arXiv1410.3059OpenAlexW3100765028MaRDI QIDQ4586148

Greg Yang

Publication date: 12 September 2018

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.3059

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probability and inductive logic (03B48) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Model theory of finite structures (03C13) Model theory of denumerable and separable structures (03C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vapnik-Chervonenkis density in some theories without the independence property. II
• Elements of finite model theory.
• Toward efficient agnostic learning
• Levels of uniformity
• Vapnik-Chervonenkis density in some theories without the independence property, I
• Computational Hardness of Validity in Probability Logic
• Decidability and Undecidability in Probability Logic
• A theory of the learnable
• Vapnik-Chervonenkis Classes of Definable Sets
• Learning Theory
• 10.1162/153244304773936072
• MODEL THEORY OF MEASURE SPACES AND PROBABILITY LOGIC
• Probabilistic Logic and Induction
• Robust logics

This page was built for publication: Computability of validity and satisfiability in probability logics over finite and countable models