Finite information logic

DOI10.1016/J.APAL.2004.06.013zbMATH Open1067.03039OpenAlexW2070162939MaRDI QIDQ1779313FDOQ1779313

Authors: Rohit Parikh, Jouko Väänänen 

Publication date: 1 June 2005

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2004.06.013

Recommendations

• scientific article; zbMATH DE number 5180966
• The logic of informational independence and finite models
• Expressivity of imperfect information logics without identity
• scientific article; zbMATH DE number 7166988
• Independence-friendly logic. A game-theoretic approach

zbMATH Keywords

Games for first-order logicIndependence friendly logicPartial information logic

Mathematics Subject Classification ID

Applications of game theory (91A80) Other nonclassical logic (03B60)

Cites Work

• Compositional semantics for a language of imperfect information
• Title not available (Why is that?)
• Social software
• Title not available (Why is that?)
• Title not available (Why is that?)
• An application of games to the completeness problem for formalized theories

Cited In (5)

• Parikh and Wittgenstein
• Equivalence and quantifier rules for logic with imperfect information
• The logic of approximate dependence
• Title not available (Why is that?)
• Logic of nondeterministic information

This page was built for publication: Finite information logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779313)