Skip to menu Skip to content Skip to footer

2021

Journal Article

Book Review: Juliet Floyd and Felix Mühlhölzer, Wittgenstein’s Annotations to Hardy’s Course of Pure Mathematics: An Investigation of Wittgenstein’s Non-Extensionalist Understanding of the Real Numbers

Solin, Kim (2021). Book Review: Juliet Floyd and Felix Mühlhölzer, Wittgenstein’s Annotations to Hardy’s Course of Pure Mathematics: An Investigation of Wittgenstein’s Non-Extensionalist Understanding of the Real Numbers. Nordic Wittgenstein Review, 157-162. doi: 10.15845/nwr.v0i0.3613

Book Review: Juliet Floyd and Felix Mühlhölzer, Wittgenstein’s Annotations to Hardy’s Course of Pure Mathematics: An Investigation of Wittgenstein’s Non-Extensionalist Understanding of the Real Numbers

2012

Journal Article

Dual choice and iteration in an abstract algebra of action

Solin, Kim (2012). Dual choice and iteration in an abstract algebra of action. Studia Logica, 100 (3), 607-630. doi: 10.1007/s11225-012-9416-9

Dual choice and iteration in an abstract algebra of action

2011

Journal Article

Normal forms in total correctness for while programs and action systems

Solin, Kim (2011). Normal forms in total correctness for while programs and action systems. Journal of Logic and Algebraic Programming, 80 (6), 362-375. doi: 10.1016/j.jlap.2011.04.008

Normal forms in total correctness for while programs and action systems

2010

Journal Article

A sketch of a dynamic epistemic semiring

Solin, Kim (2010). A sketch of a dynamic epistemic semiring. Information and Computation, 208 (5), 594-604. doi: 10.1016/j.ic.2009.03.011

A sketch of a dynamic epistemic semiring

2010

Journal Article

Refinement algebra for probabilistic programs

Meinicke, Larissa and Solin, Kim (2010). Refinement algebra for probabilistic programs. Formal Aspects of Computing, 22 (1), 3-31. doi: 10.1007/s00165-009-0111-1

Refinement algebra for probabilistic programs

2009

Journal Article

Enabledness and termination in refinement algebra

Solin, Kim and von Wright, Joakim (2009). Enabledness and termination in refinement algebra. Science of Computer Programming, 74 (8), 654-668. doi: 10.1016/j.scico.2007.11.004

Enabledness and termination in refinement algebra