Results 1 to 10 of about 7,425 (94)

Generic absoluteness and boolean names for elements of a Polish space [PDF]

, 2016
It is common knowledge in the set theory community that there exists a duality relating the commutative $C^*$-algebras with the family of $B$-names for complex numbers in a boolean valued model for set theory $V^B$.
Vaccaro, Andrea, Viale, Matteo
core   +2 more sources

Infinite time decidable equivalence relation theory [PDF]

, 2009
We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine.
Coskey, Samuel, Hamkins, Joel David
core   +1 more source

Modal Ω-Logic: Automata, Neo-Logicism, and Set-Theoretic Realism [PDF]

, 2019
This essay examines the philosophical significance of $\Omega$-logic in Zermelo-Fraenkel set theory with choice (ZFC). The duality between coalgebra and algebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras.
A Baltag, A Kanamori, A Kanamori, A Kanamori, A Kanamori, A Kurz, A Wilson, C Chihara, C Rittberg, C Wright, C Wright, C Wright, C Wright, C Wright, D Deutsch, D Deutsch, D Lewis, D Wallace, F Arntzenius, G Frege, G Marcus, G Uzquiano, H Putnam, H Rasiowa, J Hawthorne, J McKinsey, K Fine, L Henkin, M Dummett, M Takeuchi, Michael Rescorla, P Koellner, P Lewis, P Maddy, P Maddy, S Saunders, S Shapiro, S Shapiro, T Jech, T Lando, V Halbach, W Reinhardt, WH Woodin, WV Quine, Y Venema, Y Venema   +45 more
core   +9 more sources

Orthomodular-Valued Models for Quantum Set Theory [PDF]

, 2017
In 1981, Takeuti introduced quantum set theory by constructing a model of set theory based on quantum logic represented by the lattice of closed linear subspaces of a Hilbert space in a manner analogous to Boolean-valued models of set theory, and showed ...
Araki, Bruns, Cohen, Dirac, Husimi, Johnstone, Kalmbach, MASANAO OZAWA, Pulmannová, Sasaki, Scott, von Neumann   +11 more
core   +2 more sources

Intelligent Energy Optimization for User Intelligible Goals in Smart Home Environments [PDF]

, 2012
Intelligent management of energy consumption is one of the key issues for future energy distribution systems, smart buildings, and consumer appliances. The problem can be tackled both from the point of view of the utility provider, with the intelligence ...
Corno, Fulvio, Faisal Razzak
core   +1 more source

A delay differential model of ENSO variability: Parametric instability and the distribution of extremes [PDF]

, 2007
We consider a delay differential equation (DDE) model for El-Nino Southern Oscillation (ENSO) variability. The model combines two key mechanisms that participate in ENSO dynamics: delayed negative feedback and seasonal forcing.
Ghil, Michael, Thompson, Sylvester, Zaliapin, Ilya   +2 more
core   +4 more sources

Absoluteness via Resurrection

, 2017
The resurrection axioms are forcing axioms introduced recently by Hamkins and Johnstone, developing on ideas of Chalons and Velickovi\'c. We introduce a stronger form of resurrection axioms (the \emph{iterated} resurrection axioms $\textrm{RA}_\alpha ...
Audrito, Giorgio, Viale, Matteo
core   +1 more source

TreatJS: Higher-Order Contracts for JavaScript [PDF]

, 2015
TreatJS is a language embedded, higher-order contract system for JavaScript which enforces contracts by run-time monitoring. Beyond providing the standard abstractions for building higher-order contracts (base, function, and object contracts), TreatJS's ...
Keil, Matthias, Thiemann, Peter
core   +2 more sources

Distributed Verification of Rare Properties using Importance Splitting Observers [PDF]

, 2015
Rare properties remain a challenge for statistical model checking (SMC) due to the quadratic scaling of variance with rarity. We address this with a variance reduction framework based on lightweight importance splitting observers.
Jegourel, Cyrille, Legay, Axel, Sedwards, Sean, Traonouez, Louis-Marie   +3 more
core   +5 more sources

Information completeness in Nelson algebras of rough sets induced by quasiorders

, 2012
In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder $R$, its rough set-based Nelson algebra can be
A. Sendlewski, A.H. Stone, D. Nelson, D. Vakarelov, D.M. Gabbay, G. Kreisel, H. Rasiowa, J. Barwise, J. Järvinen, J. Järvinen, J.-Y. Girard, Jouni Järvinen, P. Miglioli, P. Miglioli, P. Pagliani, P. Pagliani, P. Pagliani, Piero Pagliani, R. Cignoli, S. Vickers, Sándor Radeleczki, T.S. Blyth, Z. Pawlak   +22 more
core   +1 more source