Matches in SemOpenAlex for { <https://semopenalex.org/work/W3100765028> ?p ?o ?g. }
Showing items 1 to 73 of
73
with 100 items per page.
- W3100765028 abstract "The $epsilon$-logic (which is called $epsilon$E-logic in this paper) of Kuyper and Terwijn is a variant of first order logic with the same syntax, in which the models are equipped with probability measures and in which the $forall x$ quantifier is interpreted as there exists a set $A$ of measure $ge 1 - epsilon$ such that for each $x in A$, .... Previously, Kuyper and Terwijn proved that the general satisfiability and validity problems for this logic are, i) for rational $epsilon in (0, 1)$, respectively $Sigma^1_1$-complete and $Pi^1_1$-hard, and ii) for $epsilon = 0$, respectively decidable and $Sigma^0_1$-complete. The adjective general here means uniformly over all languages. We extend these results in the scenario of finite models. In particular, we show that the problems of satisfiability by and validity over finite models in $epsilon$E-logic are, i) for rational $epsilon in (0, 1)$, respectively $Sigma^0_1$- and $Pi^0_1$-complete, and ii) for $epsilon = 0$, respectively decidable and $Pi^0_1$-complete. Although partial results toward the countable case are also achieved, the computability of $epsilon$E-logic over countable models still remains largely unsolved. In addition, most of the results, of this paper and of Kuyper and Terwijn, do not apply to individual languages with a finite number of unary predicates. Reducing this requirement continues to be a major point of research. On the positive side, we derive the decidability of the corresponding problems for monadic relational languages --- equality- and function-free languages with finitely many unary and zero other predicates. This result holds for all three of the unrestricted, the countable, and the finite model cases. Applications in computational learning theory, weighted graphs, and neural networks are discussed in the context of these decidability and undecidability results." @default.
- W3100765028 created "2020-11-23" @default.
- W3100765028 creator A5061115157 @default.
- W3100765028 date "2015-10-02" @default.
- W3100765028 modified "2023-10-16" @default.
- W3100765028 title "Computability of validity and satisfiability in probability logics over finite and countable models" @default.
- W3100765028 cites W1489366126 @default.
- W3100765028 cites W1520252399 @default.
- W3100765028 cites W1548189207 @default.
- W3100765028 cites W1789921437 @default.
- W3100765028 cites W2068589781 @default.
- W3100765028 cites W2126160338 @default.
- W3100765028 cites W2148864855 @default.
- W3100765028 cites W2156427634 @default.
- W3100765028 cites W2163361804 @default.
- W3100765028 cites W2295675105 @default.
- W3100765028 cites W3098590070 @default.
- W3100765028 cites W4232277851 @default.
- W3100765028 cites W4238893454 @default.
- W3100765028 cites W4244305482 @default.
- W3100765028 cites W4253577938 @default.
- W3100765028 cites W71992527 @default.
- W3100765028 cites W2019631316 @default.
- W3100765028 doi "https://doi.org/10.1080/11663081.2016.1139967" @default.
- W3100765028 hasPublicationYear "2015" @default.
- W3100765028 type Work @default.
- W3100765028 sameAs 3100765028 @default.
- W3100765028 citedByCount "0" @default.
- W3100765028 crossrefType "journal-article" @default.
- W3100765028 hasAuthorship W3100765028A5061115157 @default.
- W3100765028 hasBestOaLocation W31007650282 @default.
- W3100765028 hasConcept C110729354 @default.
- W3100765028 hasConcept C118615104 @default.
- W3100765028 hasConcept C152062344 @default.
- W3100765028 hasConcept C153269930 @default.
- W3100765028 hasConcept C168773769 @default.
- W3100765028 hasConcept C33923547 @default.
- W3100765028 hasConcept C6943359 @default.
- W3100765028 hasConceptScore W3100765028C110729354 @default.
- W3100765028 hasConceptScore W3100765028C118615104 @default.
- W3100765028 hasConceptScore W3100765028C152062344 @default.
- W3100765028 hasConceptScore W3100765028C153269930 @default.
- W3100765028 hasConceptScore W3100765028C168773769 @default.
- W3100765028 hasConceptScore W3100765028C33923547 @default.
- W3100765028 hasConceptScore W3100765028C6943359 @default.
- W3100765028 hasLocation W31007650281 @default.
- W3100765028 hasLocation W31007650282 @default.
- W3100765028 hasOpenAccess W3100765028 @default.
- W3100765028 hasPrimaryLocation W31007650281 @default.
- W3100765028 hasRelatedWork W1484816417 @default.
- W3100765028 hasRelatedWork W1814710822 @default.
- W3100765028 hasRelatedWork W2034539650 @default.
- W3100765028 hasRelatedWork W2047674711 @default.
- W3100765028 hasRelatedWork W2098800274 @default.
- W3100765028 hasRelatedWork W2112744831 @default.
- W3100765028 hasRelatedWork W2112863615 @default.
- W3100765028 hasRelatedWork W2120435239 @default.
- W3100765028 hasRelatedWork W2122284739 @default.
- W3100765028 hasRelatedWork W2128126407 @default.
- W3100765028 hasRelatedWork W2136823804 @default.
- W3100765028 hasRelatedWork W2140541040 @default.
- W3100765028 hasRelatedWork W2166108892 @default.
- W3100765028 hasRelatedWork W2949074985 @default.
- W3100765028 hasRelatedWork W2952266239 @default.
- W3100765028 hasRelatedWork W2952993371 @default.
- W3100765028 hasRelatedWork W2962733163 @default.
- W3100765028 hasRelatedWork W2964260039 @default.
- W3100765028 hasRelatedWork W3100765028 @default.
- W3100765028 hasRelatedWork W3105685616 @default.
- W3100765028 isParatext "false" @default.
- W3100765028 isRetracted "false" @default.
- W3100765028 magId "3100765028" @default.
- W3100765028 workType "article" @default.