The tag has no wiki summary.

learn more… | top users | synonyms

2
votes
1answer
27 views

Persistency on formulas in Kripke models

Let $ (W,R,f) $ a Kripke model. I have some trouble proving that the persistency property holds for formulas i.e if $ wRw' $ and $ w \Vdash \phi $ then $ w' \Vdash \phi $ , mainly due to the forcing ...
2
votes
1answer
29 views

Conditions for total orders in temporal logic

Let $(T,>)$ be a frame of minimal temporal logic, i.e. a frame as defined in Kripke semantics where the relation is a partial order relation $>$ defined on the set $T$ of worlds, called ...
4
votes
1answer
46 views

Symmetric relations and $\varphi\rightarrow\square\diamond\varphi$

I read that the schema $$\varphi\rightarrow\square\diamond\varphi$$ corresponds to the symmetric property (D. Palladino, C. Palladino, Logiche non classiche, 'non-classical logics', 2007) of the ...
1
vote
1answer
39 views

Euclidean relations and $\diamond P\rightarrow\square\diamond P$

I read* that the formula $$\diamond \varphi\rightarrow\square\diamond\varphi$$is valid in a structure $(W,R)$, intended as in Kripke semantics, -i.e. that it is true for any interpretation $I$ and in ...
2
votes
2answers
75 views

Logical consequence in all structures in Kripke semantics

I read* the following definition of logical consequence in all structures within Kripke semantics:$$X\models A\iff\text{ for every } (W,R),\text{ if }(W,R)\models X,\text{ then }(W,R)\models A$$ ...
0
votes
2answers
44 views

what does the “fixed point” in fixpoint algorithms refer to?

I was reading the following powerpoint here to remember something I studied a long time ago. http://www.cs.cmu.edu/~emc/15-820A/reading/lecture_1.pdf the 12th slide is labeled fixpoint algorithms, ...
1
vote
2answers
104 views

Proving the non-derivability of formula using the of the kripke model

I try proving the non-derivability of $(p\to q) \to \lnot p \lor q$, using the of the kripke model. I tried using different combinations of $Wi$, but I get fail.
0
votes
1answer
69 views

The definition of interpretation in a Kripke model collides with my intuition of what it should do

In Lindröm and Segerberg (2007) exposition of a Kripke model, with frame $F= \langle W,D,R,E,w_0\rangle$, they define an interpretation $I$ as a family of functions $I_w$, where $w$ ranges over ...
1
vote
1answer
47 views

Propositional S5: is there a consistent set requiring continuously many worlds?

A recent question asked whether in systems of modal propositional logic having the "finite model property" there are consistent sets of sentences that were not satisfied by a finite model. @Carl ...
0
votes
1answer
111 views

Propositional modal logic: infinite models required in systems with finite model property?

A system of propositional modal logic has the "finite model property" if any consistent sentence is satisfiable at a model with finitely many possible worlds. Some systems have this property and ...
1
vote
2answers
77 views

Proving Gabbay rule for Modal Logic

I'm currently working on exercises of the book "Modal Logic" by A.Chagrov and M.Zakharyaschev (for pleasure, not homework). One exercise asks to prove this version of Gabbay rule (exercise $3.10$): A ...
0
votes
1answer
38 views

Explanation of states, worlds and models?

Can someone explain to me how the concepts of states, models and worlds work together in Kripke semantics? I've been trying to piece together how the parts work are linked together but cannot figure ...
0
votes
1answer
93 views

Question concerning satisfiability in a certain Kripke model

My question concerns the exercise on p.77 of Boolos, Logic of Provability: True or false: if $A$ is satisfiable in some finite transitive and irreflexive [FIT] model and contains at most one ...
2
votes
1answer
96 views

What is the difference between First-Order Structures and Kripke Structures?

In the SEP article on Model Theory by Wilfrid Hodges (here), he writes: Particular kinds of model theory use particular kinds of structure; for example mathematical model theory tends to use ...
0
votes
1answer
149 views

A question on intuitionistc propositional logic

Prove that: Two finite rooted frames are isomorphic iff they validate the same formulas. (This is an exercise in the book "Modal Logic" by A.Chagrov and M.Zakharyaschev)