We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of "is defined" is extended to terms and formulas via a straightforward recursive algorithm. The "is defined" formulas are constructed so that they themselves are always defined. The completeness proof relies on the Henkin construction. For each formula, precisely one of the formula, its negation, and the negation of its "is defined" formula is true on the constructed model. Many other ternary logics in the literature can be reduced to ours. Partial functions are ubiquitous in computer science and even in (in)equation solving at schools. Our work was motivated by an attempt to explain, precisely in terms of logic, typical informal methods of reasoning in such applications.
Completeness and interpolation for intuitionistic infinitary predicate logic, in connection to finitizing the class of representable Heyting polyadic algebras
Axiomatization via translation: Hiz's warning for predicate logic
公理化的逻辑转换和原始算子的选择问题多年来已经出现了几次。一个早期的问题是由H.嗨{\cHFFFFFF}{\3cH111111}{\4cH111111} Hi{\4cH111111} Hi. z}在20世纪50年代关于翻译演算的不完整性。进一步的相关工作,其中一些涉及到这里,是由W。Frank和S.夏皮罗,以及其他人在随后的几十年。正如我们将看到的,忽视这种可能性导致了不正确的完整性要求(例如J。Bell和A. B. Slomson和J. N. Crossley)的公理化的经典谓词逻辑获得的翻译从公理化适合于不同选择的逻辑原语。在本文中,我们首先讨论了W.关于获得翻译演算完备性定理的困难。夏皮罗通过展示一个不可证明的命题重言式,确立了克罗斯利公理化的不完备性。与此相反,为了处理贝尔和Slomson的系统,这是完整的命题重言式,我们继续表明,采取一个正式的系统与原始$ \exists$经典谓词演算,设置$\forall x ϕ(x) \stackrel{\text{def}}{=}\neg \exists x \neg ϕ(x)$,并写下一组公理和规则完整的演算与$\forall $而不是$ \exists$作为原语,并不保证所产生的系统的完整性。特别地,有效模式$\exists x ϕ(x) \rightarrow \exists x \neg \negϕ(x)$的实例是不可证明的…
Many-valued coalgebraic dynamic logics: Safety and strong completeness via reducibility
Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence, University of Groningen(格罗宁根大学伯努利数学、计算机科学与人工智能研究所);Institute of Computer Science of the Czech Academy of Sciences(捷克科学院计算机科学研究所)