×

Found 79 Documents (Results 1–79)

Intransitive temporal multi-agent’s logic, knowledge and uncertainty, plausibility. (English) Zbl 1474.68340

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4–7, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9537, 364-375 (2016).
PDFBibTeX XMLCite
Full Text: DOI Link

Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation. (English. Russian original) Zbl 1342.03019

Sib. Math. J. 56, No. 3, 455-470 (2015); translation from Sib. Mat. Zh. 56, No. 3, 573-593 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Proof complexity of non-classical logics. (English) Zbl 1250.03116

Bezhanishvili, Nick (ed.) et al., Lectures on logic and computation. ESSLLI 2010 Copenhagen, Denmark, August 2010, ESSLLI 2011, Ljubljana, Slovenia, August 2011. Selected lecture notes. Berlin: Springer (ISBN 978-3-642-31484-1/pbk). Lecture Notes in Computer Science 7388, 1-54 (2012).
PDFBibTeX XMLCite
Full Text: DOI Link

A tableau method for checking rule admissibility in S4. (English) Zbl 1345.03033

Bolander, Thomas (ed.) et al., Proceedings of the 6th workshop on methods for modalities (M4M-6 2009), Copenhagen, Denmark, November 12–14, 2009. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 262, 17-32 (2010).
MSC:  03B45
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference