Results 261 to 270 of about 18,076 (303)
Some of the next articles are maybe not open access.
Journal of Philosophical Logic, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vincenzo Crupi, Crupi Vincenzo
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vincenzo Crupi, Crupi Vincenzo
exaly +3 more sources
The Logic of Backward Induction [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Itai Arieli, Robert J. Aumann
openaire +2 more sources
Philosophy of Science, 1945
Among the various meanings in which the word ‘probability’ is used in everyday language, in the discussion of scientists, and in the theories of probability, there are especially two which must be clearly distinguished. We shall use for them the terms ‘probability1’ and ‘probability2'.
openaire +2 more sources
Among the various meanings in which the word ‘probability’ is used in everyday language, in the discussion of scientists, and in the theories of probability, there are especially two which must be clearly distinguished. We shall use for them the terms ‘probability1’ and ‘probability2'.
openaire +2 more sources
Synthese, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Inductive Synthesis of Logic Programs and Inductive Logic Programming
1994Inductive Logic Programming deals with the problem of generating logic programs from examples, normally given as ground atoms. We briefly survey older methods (Shapiro’s MIS and Plotkin’s least general generalizations) which have set the foundations of the field and inspired more recent top-down and bottom-up approaches, respectively.
Francesco Bergadano, Daniele Gunetti
openaire +1 more source
Lemmaless Induction in Trace Logic
2022We present a novel approach to automate the verification of first-order inductive program properties capturing the partial correctness of imperative program loops with branching, integers and arrays. We rely on trace logic, an instance of first-order logic with theories, to express first-order program semantics by quantifying over program execution ...
Ahmed Bhayat +4 more
openaire +1 more source
Probabilistic Logic and Induction
Journal of Logic and Computation, 2005Summary: We give a probabilistic interpretation of first-order formulas based on Valiant's model of pac-learning. We study the resulting notion of probabilistic or approximate truth and take some first steps in developing its model theory. In particular we show that every fixed error parameter determining the precision of universal quantification gives
openaire +1 more source
A Note on Irrelevance in Inductive Logic
Journal of Philosophical Logic, 2010This paper can be seen as a call to arms to better understand relevance and irrelevance in Carnap's framework of inductive (monadic) predicate logic. The context is the usual, i.e., there are countably many constants \(a_1,a_2\dots\) that are said to exhaust the universe, finitely many unary relation symbols \(P_1,\dots,P_q\), and the usual logical ...
Paris, Jeff B., Vencovská, Alena
openaire +2 more sources
A formalization of inductive logic
Journal of Symbolic Logic, 1958In this note we show how Carnap's theory of degree of confirmation (inductive logic) may be constructed upon a very simple and restricted semantical basis. The semantical meta-languages here may either be based upon a relation ofmultiple denotationor may even benon-translational.
openaire +2 more sources
Symmetry in Polyadic Inductive Logic
Journal of Logic, Language and Information, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paris, J. B., Vencovská, A.
openaire +3 more sources

