Boolean-valued second-order logic

Daisuke Ikegami, Jouko Väänänen

研究成果: Article

2 引用 (Scopus)

抄録

In so-called full second-order logic, the second-order variables range over all subsets and relations of the domain in question. In so-called Henkin second-order logic, every model is endowed with a set of subsets and relations which will serve as the range of the second-order variables. In our Boolean-valued second-order logic, the second-order variables range over all Boolean-valued subsets and relations on the domain. We show that under large cardinal assumptions Boolean-valued second-order logic is more robust than full second-order logic. Its validity is absolute under forcing, and its Hanf and Löwenheim numbers are smaller than those of full second-order logic.

元の言語English
ページ(範囲)167-190
ページ数24
ジャーナルNotre Dame Journal of Formal Logic
56
発行部数1
DOI
出版物ステータスPublished - 2015 1 1
外部発表Yes

ASJC Scopus subject areas

  • Logic

これを引用

Boolean-valued second-order logic. / Ikegami, Daisuke; Väänänen, Jouko.

:: Notre Dame Journal of Formal Logic, 巻 56, 番号 1, 01.01.2015, p. 167-190.

研究成果: Article

Ikegami, Daisuke ; Väänänen, Jouko. / Boolean-valued second-order logic. :: Notre Dame Journal of Formal Logic. 2015 ; 巻 56, 番号 1. pp. 167-190.
@article{7449fd0d34f84dd0afb923f436a4facb,
title = "Boolean-valued second-order logic",
abstract = "In so-called full second-order logic, the second-order variables range over all subsets and relations of the domain in question. In so-called Henkin second-order logic, every model is endowed with a set of subsets and relations which will serve as the range of the second-order variables. In our Boolean-valued second-order logic, the second-order variables range over all Boolean-valued subsets and relations on the domain. We show that under large cardinal assumptions Boolean-valued second-order logic is more robust than full second-order logic. Its validity is absolute under forcing, and its Hanf and L{\"o}wenheim numbers are smaller than those of full second-order logic.",
keywords = "Boolean validity, Boolean-valued second-order logic, Full second-order logic, Ω-logic",
author = "Daisuke Ikegami and Jouko V{\"a}{\"a}n{\"a}nen",
year = "2015",
month = "1",
day = "1",
doi = "10.1215/00294527-2835065",
language = "English",
volume = "56",
pages = "167--190",
journal = "Notre Dame Journal of Formal Logic",
issn = "0029-4527",
publisher = "Duke University Press",
number = "1",

}

TY - JOUR

T1 - Boolean-valued second-order logic

AU - Ikegami, Daisuke

AU - Väänänen, Jouko

PY - 2015/1/1

Y1 - 2015/1/1

N2 - In so-called full second-order logic, the second-order variables range over all subsets and relations of the domain in question. In so-called Henkin second-order logic, every model is endowed with a set of subsets and relations which will serve as the range of the second-order variables. In our Boolean-valued second-order logic, the second-order variables range over all Boolean-valued subsets and relations on the domain. We show that under large cardinal assumptions Boolean-valued second-order logic is more robust than full second-order logic. Its validity is absolute under forcing, and its Hanf and Löwenheim numbers are smaller than those of full second-order logic.

AB - In so-called full second-order logic, the second-order variables range over all subsets and relations of the domain in question. In so-called Henkin second-order logic, every model is endowed with a set of subsets and relations which will serve as the range of the second-order variables. In our Boolean-valued second-order logic, the second-order variables range over all Boolean-valued subsets and relations on the domain. We show that under large cardinal assumptions Boolean-valued second-order logic is more robust than full second-order logic. Its validity is absolute under forcing, and its Hanf and Löwenheim numbers are smaller than those of full second-order logic.

KW - Boolean validity

KW - Boolean-valued second-order logic

KW - Full second-order logic

KW - Ω-logic

UR - http://www.scopus.com/inward/record.url?scp=84926627021&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84926627021&partnerID=8YFLogxK

U2 - 10.1215/00294527-2835065

DO - 10.1215/00294527-2835065

M3 - Article

AN - SCOPUS:84926627021

VL - 56

SP - 167

EP - 190

JO - Notre Dame Journal of Formal Logic

JF - Notre Dame Journal of Formal Logic

SN - 0029-4527

IS - 1

ER -