Results 41 to 50 of about 503 (185)

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, Luca Cardelli, Kim G. Larsen   +2 more
doaj   +1 more source

Taking Risks, With and Without Probabilities

Noûs, EarlyView.
ABSTRACT Some hold that expected utility is too restrictive in the way it handles risk. Risk‐weighted expected utility is an alternative that allows decision‐makers to have a range of attitudes toward probabilistic risk. It holds that any attitude within this range is instrumentally rational, since these attitudes represent different, equally good ...
Lara Buchak
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

Structure and Computation

Noûs, EarlyView.
ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
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

On Signifiable Computability: Part II: An Axiomatization of Signifiable Computation and Debugger Theorems

Mathematics
Signifiable computability aims to separate what is theoretically computable from what is computable through performable processes on computers with finite amounts of memory.
Vladimir A. Kulyukin
doaj   +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

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

Geometrinin Temellendirilmesinde Frege – Hilbert İhtilafının Kökenleri

Felsefe Dünyası
Frege ve Hilbert arasında yirminci yüzyılın başlarında geometrinin temellendirilmesi üzerine gerçekleşmiş olan yazışmalar, ikili arasındaki geometri aksiyomlarının statüsüne yönelik farklı fikirleri ortaya koymaktadır.
Şeyma Nur Tan
doaj   +1 more source