Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Towards a generalization of modal definability (CROSBI ID 44005)

Prilog u knjizi | izvorni znanstveni rad

Perkov, Tin Towards a generalization of modal definability // New Directions in Logic, Language and Computation. ESSLLI 2010 and ESSLLI 2011 Student Sessions : Selected Papers / Lassiter, Daniel ; Slavkovik, Marija (ur.). Berlin : Heidelberg: Springer, 2012. str. 130-139

Podaci o odgovornosti

Perkov, Tin

engleski

Towards a generalization of modal definability

Known results on global definability in basic modal logic are generalized in the following sense. A class of Kripke models is usually called modally definable if there is a set of modal formulas such that a class consists exactly of models on which every formula of that set is globally true, i. e. universally quantified standard translations of these formulas to the corresponding first order language are true. Here, the notion of definability is extended to existentially quantified translations of modal formulas – a class is called modally ∃-definable if there is a set of modal formulas such that a class consists exactly of models on which every formula of that set is satisfiable. A characterization result is given in usual form, in terms of closure conditions on such classes of models.

modal logic, model theory, modal definability

Predavanje sa skupa European Summer School in Logic, Language and Information ESSLLI 2011, održanog u Ljubljani, Slovenija, 01-12.08.2011.g.

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

130-139.

objavljeno

Podaci o knjizi

New Directions in Logic, Language and Computation. ESSLLI 2010 and ESSLLI 2011 Student Sessions : Selected Papers

Lassiter, Daniel ; Slavkovik, Marija

Berlin : Heidelberg: Springer

2012.

978-3-642-31466-7

Povezanost rada

Matematika