Results 1 to 10 of about 904 (144)
Overgeneration in the Higher Infinite [PDF]
The Overgeneration Argument is a prominent objection against the model-theoretic account of logical consequence for second-order languages. In previous work we have offered a reconstruction of this argument which locates its source in the conflict ...
Florio, Salvatore, Incurvati, Luca
core +3 more sources
Categoricity, Open-Ended Schemas and Peano Arithmetic [PDF]
One of the philosophical uses of Dedekind’s categoricity theorem for Peano Arithmetic is to provide support for semantic realism. To this end, the logical framework in which the proof of the theorem is conducted becomes highly significant.
Ludușan, Adrian
core +1 more source
Group covers, o-minimality, and categoricity [PDF]
We study the model theory of covers of groups definable in o-minimal structures. This includes the case of covers of compact real Lie groups. In particular we study categoricity questions, pointing out some notable differences with the case of covers of ...
Berarducci, Alessandro +2 more
core +5 more sources
On theories of random variables [PDF]
We study theories of spaces of random variables: first, we consider random variables with values in the interval $[0,1]$, then with values in an arbitrary metric structure, generalising Keisler's randomisation of classical structures.
A. Rose +26 more
core +5 more sources
On Godel's Way In: The Influence of Rudolf Carnap [PDF]
Philosoph
Goldfarb, Warren
core +1 more source
Metalogic and the Overgeneration Argument [PDF]
A prominent objection against the logicality of second-order logic is the so-called Overgeneration Argument. However, it is far from clear how this argument is to be understood.
Florio, Salvatore, Incurvati, Luca
core +3 more sources
Notes on w-inconsistent Theories of Truth in Second-Order Languages [PDF]
It is widely accepted that a theory of truth for arithmetic should be consistent, but ω-consistency is less frequently required. This paper argues that ω-consistency is a highly desirable feature for such theories.
Barrio, Eduardo Alejandro +1 more
core +2 more sources
A Note on Carnap’s Result and the Connectives [PDF]
Carnap’s result about classical proof-theories not ruling out non-normal valuations of propositional logic formulae has seen renewed philosophical interest in recent years. In this note I contribute some considerations which
Haze, Tristan
core
Cores of Countably Categorical Structures
A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems.
Erich Grädel, Manuel Bodirsky
core +1 more source
Galois-stability for Tame Abstract Elementary Classes
We introduce tame abstract elementary classes as a generalization of all cases of abstract elementary classes that are known to permit development of stability-like theory. In this paper we explore stability results in this context.
Grossberg, Rami, VanDieren, Monica
core +3 more sources

