Arrow Research search
Back to FLAP

FLAP 2017

A Proof Theory for First-order Logic with Definiteness.

Journal Article Number 2 Logic in Computer Science

Abstract

The paper presents a proof-theory (in the form of a natural-deduction (ND) proof-system) for definiteness, expressed as the ι-subnector, extending 1-st order logic. The ND-system is proposed as meaning conferring and is shown to qualify as such by being harmonious and stable. Some relationship of this prooftheory with the presupposition of definiteness is pointed out.

Authors

Keywords

  • Definiteness
  • iota operator
  • proof-theoretic semantics
  • harmony

Context

Venue
IfCoLog Journal of Logics and their Applications
Archive span
2014-2026
Indexed papers
633
Paper id
828266354307435274
v2026.09.13