1976/10/01 by Robert K. Meyer · 5 citations
Computer Science · #Logic, Reasoning, and Knowledge #Advanced Algebra and Logic #Logic, programming, and type systems
paper · pdf · doi:10.1305/ndjfl/1093887722
In By deepening and making more intuitive the logical analysis implicit in [l], we develop here a kindred notion of metacompleteness; & logic is metacomplete provided that exactly the sentences true on a certain preferred interpretation of that logic in its metalogic are theorems. Acquaintance with [l] is not presupposed. We shall show in particular that a number of familiar logics, e.g., of the intuitionist, modal, and relevant families, are metacomplete, and that accordingly these logics share with intuitionist calculi two interesting properties: