Results 1 
4 of
4
BARWISE: INFINITARY LOGIC AND ADMISSIBLE SETS
"... 1. Background on infinitary logic 2 1.1. Expressive power of Lω1ω 2 1.2. The backandforth construction 3 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
1. Background on infinitary logic 2 1.1. Expressive power of Lω1ω 2 1.2. The backandforth construction 3
ANALYSIS IN J2
, 2005
"... Abstract. This is an expository paper in which I explain how core mathematics, particularly abstract analysis, can be developed within a concrete countable set J2 (the second set in Jensen’s constructible hierarchy). The implication, wellknown to proof theorists but probably not to most mainstream ..."
Abstract
 Add to MetaCart
Abstract. This is an expository paper in which I explain how core mathematics, particularly abstract analysis, can be developed within a concrete countable set J2 (the second set in Jensen’s constructible hierarchy). The implication, wellknown to proof theorists but probably not to most mainstream mathematicians, is that ordinary mathematical practice does not require an enigmatic metaphysical universe of sets. I go further and argue that J2 is a superior setting for normal mathematics because it is free of irrelevant settheoretic pathologies and permits stronger formulations of existence results. Perhaps many mathematicians would admit to harboring some feelings of discomfort about the ethereal quality of Cantorian set theory. Yet draconian alternatives such as intuitionism, which holds that simple numbertheoretic statements like the twin primes conjecture may have no definite truth value, probably violate the typical working mathematician’s intuition far more severely than any vague unease he may feel about remote cardinals such as, say, ℵℵω. I believe that ordinary mathematical practice is actually most compatible with
Transfinite Machine Models
, 2011
"... In recent years there has emerged the study of discrete computational models which are allowed to act transfinitely. By ‘discrete ’ we mean that the machine models considered are not analogue machines, but compute by means of distinct stages or in units of time. The paradigm of such models is, of co ..."
Abstract
 Add to MetaCart
In recent years there has emerged the study of discrete computational models which are allowed to act transfinitely. By ‘discrete ’ we mean that the machine models considered are not analogue machines, but compute by means of distinct stages or in units of time. The paradigm of such models is, of course, Turing’s original