Zobrazeno 1 - 10
of 553
pro vyhledávání: '"Conservative extension"'
Autor:
van Inwagen, Peter, author
Publikováno v:
The Abstract and the Concrete : Further Essays in Ontology, 2024.
Externí odkaz:
https://doi.org/10.1093/oso/9780192870452.003.0008
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Saeide Zahiri, Arsham Borumand Saeid
Publikováno v:
Soft Computing. 25:6841-6849
The present study aimed to propose the similarity triangle algebra and prove the completeness of the similarity triangle logic. The similarity was defined on triangle algebra. Similarity triangle algebra is a triangle algebra endowed with a binary op
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 332:1-17
Definitions of new symbols merely abbreviate expressions in logical frameworks, and no new facts (regarding previously defined symbols) should hold because of a new definition. In Isabelle/HOL, definable symbols are types and constants. The latter ma
Autor:
Grigore Rosu, Xiaohong Chen
Publikováno v:
Proceedings of the ACM on Programming Languages. 4:1-32
We propose a novel definition of binders using matching logic, where the binding behavior of object-level binders is directly inherited from the built-in exists binder of matching logic. We show that the behavior of binders in various logical systems
Autor:
Yale Weiss
Publikováno v:
Studia Logica. 109:125-136
In this article, I present a semantically natural conservative extension of Urquhart’s positive semilattice logic with a sort of constructive negation. A subscripted sequent calculus is given for this logic and proofs of its soundness and completen
Autor:
Sergiy Koshkin
Publikováno v:
Analytic Philosophy. 62:252-274
Wittgenstein's paradoxical theses that unproved propositions are meaningless, proofs form new concepts and rules, and contradictions are of limited concern, led to a variety of interpretations, most of them centered on the rule-following skepticism.
Publikováno v:
Journal of Cryptology, 33 (2)
Game-based proofs are a well-established paradigm for structuring security arguments and simplifying their understanding. We present a novel framework, CryptHOL, for rigorous game-based proofs that is supported by mechanical theorem proving. CryptHOL
Autor:
Marcelo Fiore, Philip Saville
Publikováno v:
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science ISBN: 9783030452308
FoSSaCS
Saville, P & Fiore, M 2020, Relative full completeness for bicategorical cartesian closed structure . in Foundations of Software Science and Computation Structures : International Conference on Foundations of Software Science and Computation Structures FoSSaCS 2020 . Lecture Notes in Computer Science, vol. 12077, 23rd International Conference on Foundations of Software Science and Computation Structures, Dublin, Ireland, 25/04/20 . https://doi.org/10.1007/978-3-030-45231-5_15
Lecture Notes in Computer Science ISBN: 9783030452308
FoSSaCS
Saville, P & Fiore, M 2020, Relative full completeness for bicategorical cartesian closed structure . in Foundations of Software Science and Computation Structures : International Conference on Foundations of Software Science and Computation Structures FoSSaCS 2020 . Lecture Notes in Computer Science, vol. 12077, 23rd International Conference on Foundations of Software Science and Computation Structures, Dublin, Ireland, 25/04/20 . https://doi.org/10.1007/978-3-030-45231-5_15
The glueing construction, defined as a certain comma category, is an important tool for reasoning about type theories, logics, and programming languages. Here we extend the construction to accommodate ‘2-dimensional theories’ of types, terms betw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58fdbf1b0e36a2f5006c9177488f342f
https://doi.org/10.26226/morressier.604907f51a80aac83ca25d68
https://doi.org/10.26226/morressier.604907f51a80aac83ca25d68
Autor:
Leonardo Ceragioli
Publikováno v:
Theoria. 85:459-484