Searcharxiv⌕ Search

arXiv subjects

Constantin C. Brîncuş

Publications and source records attributed to Constantin C. Brîncuş.

2 recordsLinked to original sources

Carnapian Frameworks and Categoricity of Arithmetic via Inferential $ω$-logics

We provided in \cite{BaldwinBrincusI} extensions of first order logic by modified inferential definitions of the classical $ω$-rule in $1$ or $2$ sorts. These logics are categorical in the inferential sense. Arithmetic has a unique countable model in each case, e.g. first order PA is categorical in our first logic. The 2-sorted case interprets $L_{ω_1,ω}$. In this paper, we discuss two philosophical problems raised by Button and Walsh \cite{ButtonWalshbook} concerting the identification of a unique isomorphism class. First, we argue that the doxological challenge (on referential determinacy) gets a clear answer if placed in an appropriate (Carnapian) linguistic framework and is meaningless otherwise. To clarify this approach, we address Button-Walsh's dismissal of concepts-modelism by developing the notion of {\em cognitive modelism}, according to which classical mathematics is a complex process of constructing and developing a distinctive class of concepts. Second, we argue that the inferential $ω$-logics, that are much weaker than second order logic, do not appeal to the arithmetical concepts that the categoricity theorems proved within these logics aim to secure.

math.LO↗

Categoricity for an inferential $ω$-logic and in $L_{ω_1,ω}$

This paper provides two extensions of first order logic by `$ω$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $ω$-logic, both Robinson's system $Q$ and Peano Arithmetic become categorical. In the two-sorted generalized $ω$-logic we show each complete $L_{ω_1,ω}$ sentence defines the same class of structures as a first-order theory with the appropriate $G-ω$-rule. The results depend on proving that the inferential rules for the logics are categorical, i.e. they uniquely determine certain truth-conditions for the logical connectives and quantifiers.

math.LO↗