Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Peter Apostoli"'
Autor:
Peter Apostoli
Publikováno v:
Journal of Symbolic Logic. 65:33-102
Until very recently, it was thought that there couldn't be anycurrentinterest in logicism as a philosophy of mathematics. Indeed, there is an old argument one often finds that logicism is a simple nonstarter just in virtue of the fact that if it were
Autor:
Peter Apostoli
Publikováno v:
Mathematical Logic Quarterly. 42:175-190
This paper articulates the structure of a two species of weakly aggregative necessity in a common idiom, neighbourhood semantics, using the notion of a k-filter of propositions. A k-filter on a non-empty set I is a collection of subsets of I which (i
Autor:
Peter Apostoli, Bryson Brown
Publikováno v:
Journal of Symbolic Logic. 60:832-842
We are accustomed to regardingKas the weakest modal logic admitting of a relational semantics in the style made popular by Kripke. However, in a series of papers which demonstrates a startling connection between modal logic and the theory of paracons
Autor:
Peter Apostoli, Mark Balaguer, Daniel Bonevac, David Bostock, Mark Colyvan, James Franklin, W.D. Hart, Roland Hinnion, Jaakko Hintikka, Andrew D. Irvine, Akira Kanda, Akihiro Kanamori, Thierry Libert, Charles McCarty, Chris Mortensen, Wilfried Sieg, Peter Simons, Mary Tiles, Jon Williamson
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28061db1a448effa0b822f233c74895b
https://doi.org/10.1016/b978-0-444-51555-1.50004-3
https://doi.org/10.1016/b978-0-444-51555-1.50004-3
Autor:
Akira Kanda, Peter Apostoli
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540140405
RSFDGrC
RSFDGrC
An approximation space (U, R) placed in a type-lowering retraction with 2U × U provides a model for a first order calculus of relations for computing over lists and reasoning about the resulting programs. Upper and lower approximations to the scheme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b4591604456631712f34c41f5f11fb6
https://doi.org/10.1007/3-540-39205-x_26
https://doi.org/10.1007/3-540-39205-x_26
Autor:
Akira Kanda, Peter Apostoli
Publikováno v:
Rough Sets and Current Trends in Computing ISBN: 9783540430742
Rough Sets and Current Trends in Computing
Rough Sets and Current Trends in Computing
We present an approximation space (U, R) which is an infinite (hypercontinuum) solution to the domain equation U ≅ C(R), the family of elementary subsets of U. Thus U is a universe of type-free sets and R is the relation of indiscernibility with re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a97c26397097aa31d6722f65f7416e4b
https://doi.org/10.1007/3-540-45554-x_11
https://doi.org/10.1007/3-540-45554-x_11
Autor:
Peter Apostoli
Publikováno v:
Logic, Meaning and Computation ISBN: 9789401038911
Following Paul Gilmore’s LK-style natural deduction based set theories, we present a first order logic of type-free abstraction which employs “truth value gaps” to maintain consistency. By adjoining LK bivalence axioms governing the definitions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dad1cc9db7d17c5d614b8da5472d1049
https://doi.org/10.1007/978-94-010-0526-5_1
https://doi.org/10.1007/978-94-010-0526-5_1