Results 41 to 50 of about 506 (185)
On the Existential Theory of the Completions of a Global Field
Mathematische Nachrichten, EarlyView.ABSTRACT We discuss the common existential theory of all or almost all completions of a global function field.
Philip Dittmann, Arno Fehm
wiley +1 more source
Axiomatizing Consciousness with Applications
, 2022 17 pages, 2 ...
Barendregt, H.P., Raffone, A.
openaire +3 more sources
Continuous Markovian Logics - Axiomatization and Quantified Metatheory [PDF]
Logical Methods in Computer Science, 2012 Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes (CMPs).
Radu Mardare +2 more
doaj +1 more source
Toward an Axiomatization of Strongly Possible Functional Dependencies
Vietnam Journal of Computer Science, 2021 In general, there are two main approaches to handle the missing data values problem in SQL tables. One is to ignore or remove any record with some missing data values.
Munqath Alattar, Attila Sali
doaj +1 more source
Precautionary Saving against Correlation under Risk and Ambiguitya
Journal of Money, Credit and Banking, EarlyView.Abstract This paper considers precautionary saving against the correlation between two risky attributes (wealth and health) and investigates how the correlation affects optimal savings under multivariate preferences. The signs of higher‐order cross‐derivatives play a key role in determining the direction of precautionary saving against such correlation.
TAKAO ASANO, YUSUKE OSAKI
wiley +1 more source
Axiomatizations of team logics [PDF]
Annals of Pure and Applied Logic, 2018 In a modular approach, we lift Hilbert-style proof systems for propositional, modal and first-order logic to generalized systems for their respective team-based extensions. We obtain sound and complete axiomatizations for the dependence-free fragment FO(~) of Väänänen's first-order team logic TL, for propositional team logic PTL, quantified ...
openaire +3 more sources
Never, Ever Getting Started: On Prospect Theory Without Commitment
Mathematical Finance, EarlyView.ABSTRACT Prospect theory is arguably the most prominent alternative to expected utility theory. We study the investment or gambling behavior of a prospect theory decision maker who is aware of his time‐inconsistency but lacks commitment. For the empirically relevant prospect theory specifications, we obtain the extreme prediction that such a decision ...
Sebastian Ebert, Philipp Strack
wiley +1 more source
Axiomatizing complete positivity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 There are two ways to turn a categorical model for pure quantum theory into one for mixed quantum theory, both resulting in a category of completely positive maps.
Oscar Cunningham, Chris Heunen
doaj +1 more source
Why Are All the Sets All the Sets?
Noûs, EarlyView.ABSTRACT Necessitists about set theory think that the pure sets exists, and are the way they are, as a matter of necessity. They cannot explain why the sets (de rebus) are all the sets. This constitutes the Ur‐Objection against necessitism; it is the primary motivation cited by potentialists about set theory.
Tim Button
wiley +1 more source
Cellular Automata are Generic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular automaton ...
Nachum Dershowitz, Evgenia Falkovich
doaj +1 more source