Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Vedran Čačić"'
Autor:
Tin Adlešić, Vedran Čačić
Publikováno v:
Bulletin of the Section of Logic, Vol 52, Iss 4, Pp 551-581 (2023)
In this paper, we rigorously prove the existence of type-level ordered pairs in Quine’s New Foundations with atoms, augmented by the axiom of infinity and the axiom of choice (NFU + Inf + AC). The proof uses the cardinal squaring principle; more pr
Externí odkaz:
https://doaj.org/article/02ad572bc5b04b83bed4518d27bf9706
Publikováno v:
Rad Hrvatske akademije znanosti i umjetnosti. Matematičke znanosti. :1-11
We identify a general reordering principle for well-ordered series in Banach spaces. We prove that for every absolutely convergent well-ordered series indexed by a countable ordinal, if the seriesis rearranged according to any countable ordinal, then
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19e10d848f29b00c148f29383b54c71f
https://doi.org/10.21857/yq32oh4qd9
https://doi.org/10.21857/yq32oh4qd9
In the setting of computable topological spaces, we consider semicomputable, chainable Hausdorff continua. If such a continuum S is decomposable, it can be computably approximated; more precisely, for every open cover U , there exist two computable p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4f892b219836f7ef142939b3fecf6f9
https://doi.org/10.1016/j.tcs.2021.09.018
https://doi.org/10.1016/j.tcs.2021.09.018
Autor:
Vedran Čačić, Vjekoslav Kovač
Normal forms for wide classes of closed IL formulas were given in [4]. Here we quantify asymptotically, in exact numbers, how wide those classes are. As a consequence, we show that the "majority" of closed IL formulas have GL-equivalents, and by that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71b6c78539776eafaad3d794f498e977
https://doi.org/10.1007/s00153-015-0438-7
https://doi.org/10.1007/s00153-015-0438-7
Publikováno v:
Math.e
Volume 26
Issue 1
Volume 26
Issue 1
Logičko programiranje je paradigma nastala početkom sedamdesetih godina proš-log stoljeća kao direktna posljedica rada na automatiziranim dokazivačima teorema. U logičkom programiranju logika se koristi kao deklarativni jezik za opisivanje prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______951::49bdcd0c1fc8b0c724ea71592777044d
https://hrcak.srce.hr/133048
https://hrcak.srce.hr/133048
Autor:
Vedran Čačić, Mladen Vuković
Publikováno v:
Mathematical Communications
Volume 17
Issue 1
Volume 17
Issue 1
In [8], P. Hájek and Švejdar determined normal forms for the system ILF, and showed that we can eliminate the modal operator $rhd$ from $IL$--formulas. The normal form for the closed fragment of the interpretability logic $IL$ is an open problem (s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______951::3159bbf0a62226879a71eb8de2bf9b82
https://hrcak.srce.hr/82998
https://hrcak.srce.hr/82998
Autor:
Domagoj Vrgoč, Vedran Čačić
Provability logic is a modal logic for studying properties of provability predicates, and Interpretability logic for studying interpretability between logical theories. Their natural models are GL-models and Veltman models, for which the accessibilit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::883d947dcfba850b24dfc3fe1468d32c
https://www.bib.irb.hr/546703
https://www.bib.irb.hr/546703
Publikováno v:
Logic Group Preprint Series, 258
We study the interpretation of Grzegorczyk’s Theory of Concatenation TC in structures of decorated linear order types satisfying Grzegorczyk’s axioms. We show that TC is incomplete for this interpretation. What is more, the first order theory val
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6d62e75a039c2c9bb87fcbf6b5addae
https://dspace.library.uu.nl/handle/1874/26718
https://dspace.library.uu.nl/handle/1874/26718