Ultralogics and probability models
Assume that \(L\) is a nonempty set that represents a language and let \(\mathcal P\) denote the set-theoretic power set operator. A mapping \(\mathcal C : \mathcal P (L)\to \mathcal P (L)\) is a general consequence operator (or closure operator) if for each \(X,Y\in\mathcal P(L)\):NEWLINENEWLINENEWLINE(i) \(X\subset \mathcal C(X)=\mathcal C(\mathcal C(X))\subset L\), and NEWLINENEWLINENEWLINE(ii) \(X\subset Y\), then \(\mathcal C(X)\subset\mathcal C(Y)\). NEWLINENEWLINENEWLINEA consequence operator is called finite whenever \(\mathcal C(X)=\bigcup\{\mathcal C(A)\mid A\in F(X)\}\) where \(F\) is the finite power set operator. In this paper, the author discusses, by using nonstandard analysis, how nonstandard consequence operators, ultralogics, can generate the informational content determined by probability models.
- Probability logic: A model-theoretic perspective
- Probability logics
- Hyperfinite models of adapted probability logic
- scientific article; zbMATH DE number 1946849
- scientific article; zbMATH DE number 4211134
- Probability logics. Probability-based formalization of uncertain reasoning
- Probabilistic logic
- scientific article; zbMATH DE number 1749201
- A LOGIC FOR UNCERTAIN PROBABILITIES
- scientific article; zbMATH DE number 4066847
- Hyperfinite and standard unifications for physical theories
- The best possible unification for any collection of physical theories
- scientific article; zbMATH DE number 4041922 (Why is no real title available?)
- scientific article; zbMATH DE number 591401 (Why is no real title available?)
- Erratum to: ``Ultralogics and probability models
- General logic-systems and finite consequence operators
This page was built for publication: Ultralogics and probability models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957224)
