Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Luka Mikec"'
Publikováno v:
Mathematical Logic Quarterly. 68:352-374
The notion of a critical successor in relational semantics has been central to most classic modal completeness proofs in interpretability logics. In this paper we shall work with a more general notion, that of an assuring successor. This will enable
Autor:
Tin Perkov, Luka Mikec
Publikováno v:
Mathematical Logic Quarterly. 66:316-325
We prove an existential analogue of Goldblatt-Thomason theorem which characterizes modal definability of elementary classes of Kripke frames using closure under model theoretic constructions. The less known version of Goldblatt-Thomason theorem gives
Autor:
Tin Perkov, Luka Mikec
We define a procedure for translating a given first-order formula to an equivalent modal formula, if one exists, by using tableau-based bisimulation invariance test. A previously developed tableau procedure tests bisimulation invariance of a given fi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4881c7132285bd2c77b9b7d3dbe2b57d
https://www.bib.irb.hr/1169593
https://www.bib.irb.hr/1169593
Autor:
Luka Mikec
Publikováno v:
The Bulletin of Symbolic Logic. 28:265-265
We study various properties of formalised relativised interpretability. In the central part of this thesis we study for different interpretability logics the following aspects: completeness for modal semantics, decidability and algorithmic complexity
Autor:
Mladen Vuković, Luka Mikec
We obtain modal completeness of the interpretability logics IL $\!\!\textsf {P}_{\textsf {0}}$ and ILR w.r.t. generalised Veltman semantics. Our proofs are based on the notion of full labels [2]. We also give shorter proofs of completeness w.r.t. the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12657be3749c3c5bbec0fa708efdcbc5
https://www.bib.irb.hr/1097426
https://www.bib.irb.hr/1097426
Publikováno v:
Logic Journal of the IGPL. 25:758-772
The finite model property is a key step in proving decidability of modal logics. By adapting the filtration method to the generalized Veltman semantics for interpretability logics, we have been able to prove the finite model property of interpretabil
We show that the decision problem for the basic system of interpretability logic IL is PSPACE-complete. For this purpose we present an algorithm which uses polynomial space with respect to the complexity of a given formula. The existence of such algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a31f82ce74dea096b1c77eab8d9cc0f
https://www.bib.irb.hr/983020
https://www.bib.irb.hr/983020
Autor:
Luka Mikec, Tin Perkov
Publikováno v:
Math.e
Volume 32
Issue 1
Volume 32
Issue 1
Modalna logika obuhvaća široku familiju formalnih jezika i sistema s brojnim primjenama u računarstvu, lingvistici, filozofiji, teoriji informacija itd. Modalna logika ima iznenađujuće jednostavnu sintaksu i relacijsku semantiku koja se gotovo b
Publikováno v:
ResearcherID
MIPRO
MIPRO
A person can quickly grasp the genre (drama, comedy, cartoons, etc.) from a movie poster, regardless of visual clutter and the level of details. Bearing this in mind, it can be assumed that simple properties of a movie poster should play a significan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67b96040ab3db5cdcbda1af9a08ecf0a
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=ORCID&SrcApp=OrcidOrg&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=WOS:000346438700230&KeyUID=WOS:000346438700230
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=ORCID&SrcApp=OrcidOrg&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=WOS:000346438700230&KeyUID=WOS:000346438700230