2000 character limit reached
A completeness theorem in proof-theoretic semantics via set-theoretic semantics
Published 16 May 2025 in math.LO | (2505.10765v1)
Abstract: We investigate the completeness of intuitionistic logic with respect to Prawitz's proof-theoretic validity. As an intuitionistic natural deduction system, we apply atomic second-order intuitionistic propositional logic. By developing phase semantics with proof-terms introduced by Okada & Takemura (2007), we construct a special phase model whose domain consists of closed terms. We then discuss how our phase semantics can be regarded as proof-theoretic semantics, and we prove completeness with respect to proof-theoretic semantics via our phase semantics.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.