uu.seUppsala University Publications
Change search
Refine search result
1 - 17 of 17
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Berts, Kim-Erik
    et al.
    Åbo Akademi, Åbo, Finland.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy.
    Matematiken och Wittgenstein: en introduktion i matematikens filosofi2010Book (Other academic)
  • 2.
    Dongol, Brijesh
    et al.
    Department of Computer Science, The University of Sheffield, UK.
    Hayes, Ian James
    School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia.
    Meinicke, Larissa
    School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia.
    Solin, Kim
    School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia.
    Towards an algebra for real-time programs2012In: Relational and Algebraic Methods in Computer Science - 13th International Conference, Springer, 2012, p. 50-65Conference paper (Refereed)
    Abstract [en]

    We develop an algebra for an interval-based model that has been shown to be useful for reasoning about real-time programs. In that model, a system’s behaviour over all time is given by a stream (mapping each time to a state) and the behaviour over an interval is determined using an interval predicate, which maps an interval and a stream to a Boolean. Intervals are allowed to be open/closed at either end and adjoining (i.e., immediately adjacent) intervals do not share any common points but are contiguous over their boundary. Values of variables at the ends of open intervals are determined using limits, which allows the possible piecewise continuity of a variable at the boundaries of an interval to be handled in a natural manner. What sort of an algebra does this model give rise to? In this paper, we take a step towards answering that question by investigating an algebra of interval predicates.

  • 3. Meinicke, Larissa Anne
    et al.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy.
    Refinement Algebra for Probabilistic Programs2010In: Formal Aspects of Computing, ISSN 0934-5043, E-ISSN 1433-299X, Vol. 22, no 1, p. 3-31Article in journal (Refereed)
    Abstract [en]

    We identify a refinement algebra for reasoning about probabilistic program transformations in a total-correctness setting. The algebra is equipped with operators that determine whether a program is enabled or terminates respectively. As well as developing the basic theory of the algebra we demonstrate how it may be used to explain key differences and similarities between standard (i.e. non-probabilistic) and probabilistic programs and verify important transformation theorems for probabilistic action systems.

  • 4.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy.
    A Sketch of a Dynamic Epistemic Semiring2010In: Information and Computation, ISSN 0890-5401, E-ISSN 1090-2651, Vol. 208, no 5, p. 594-604Article in journal (Refereed)
    Abstract [en]

    This paper proposes a semiring formulation for reasoning about an agent’s changing beliefs: a dynamic epistemic semiring (DES). A DES is a modal semiring extended with epistemic-action operators. The paper concentrates on the revision operator by proposing an axiomatisation, developing a basic calculus and deriving the classical AGM revision axioms in the algebra. Iterated action is also considered.

  • 5. Solin, Kim
    Abstract Algebra of Program Refinement2007Doctoral thesis, monograph (Other academic)
  • 6.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy, Logic and Metaphysics.
    Dual Choice and Iteration in an Abstract Algebra of Action2012In: Studia Logica: An International Journal for Symbolic Logic, ISSN 0039-3215, E-ISSN 1572-8730, Vol. 100, no 3, p. 607-630Article in journal (Refereed)
    Abstract [en]

    This paper presents an abstract-algebraic formulation of action facilitating reasoning about two opposing agents. Two dual nondeterministic choice operators are formulated abstract-algebraically: angelic (or user) choice and demonic (or system) choice. Iteration operators are also defined. As an application, Hoare-style correctness rules are established by means of the algebra. A negation operator is also discussed.

  • 7.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy.
    Encoding and Decoding in Refinement Algebra2015In: Relational and Algebraic Methods in Computer Science - 15th International Conference, RAMiCS 2015, Braga, Portugal, September 28 - October 1, 2015, Proceedings / [ed] Wolfram Kahl, Michael Winter and José N. Oliveira, Springer Berlin/Heidelberg, 2015Conference paper (Refereed)
  • 8.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy, Logic and Metaphysics.
    Gombrowicz mot vetenskapen och existentialismen2017In: Nya Argus, ISSN 0027-7126, Vol. 110, no 1-2, p. 32-37Article in journal (Other (popular science, discussion, etc.))
  • 9.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy.
    Mathematicism in Computability Theory2014In: Church's Thesis: Logic, Mind and Nature / [ed] Adam Olszewski, Bartosz Brozek, Piotr Urbanczyk, Krakow: Copernicus Center Press , 2014, p. 55-113Chapter in book (Refereed)
  • 10.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy.
    Mathematics and religion: on a remark by Simone Weil2012In: Logic in Theology / [ed] Bartosz Brozek, Adam Olszewski, Mateusz Hohol, Krakow: Copernicus Center Press , 2012, p. 219-236Chapter in book (Refereed)
  • 11.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy.
    Modal semirings with operators for knowledge representation2013In: Proceedings of the 5th International Conference on Agents and Artificial Intelligence, Montreal, Quebec, Canada: Scitepress , 2013, p. 197-202Conference paper (Refereed)
  • 12.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy, Logic and Metaphysics.
    Normal forms in total correctness for while programs and action systems2011In: Journal of Logic and Algebraic Programming, ISSN 1567-8326, E-ISSN 1873-5940, Vol. 80, no 6, p. 362-375Article in journal (Refereed)
    Abstract [en]

    A classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast to Kozen's partial-correctness proof of the theorem in Kleene algebra with tests, the derivation in demonic refinement algebra provides a proof that the theorem holds in total correctness. A normal form for action systems is also discussed.

  • 13.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy, Logic and Metaphysics.
    Om olika hållningar till matematiken2019In: Gensvar: Essäer för Göran Torrkulla / [ed] Mio Lindman, Salla Peltonen, Hugo Strandberg, Åbo: Åbo Akademi , 2019, p. 153-163Chapter in book (Other academic)
  • 14.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy, Logic and Metaphysics.
    Rush Rhees on Wittgenstein's Philosophy of Mathematics2018In: Philosophy of Logic and Mathematics: 41st International Wittgenstein Symposium / [ed] Gabriele M. Mras; Paul Weingartner; Bernhard Ritter, 2018, p. 233-235Conference paper (Refereed)
  • 15.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy.
    The Mathematician as Mathematics: Theories of Computation in Light of Wittgenstein's Thought2013Doctoral thesis, monograph (Other academic)
    Abstract [en]

    Theories of computation are considered in light of Wittgenstein's thought. The dissertation is divided into three parts.

    The first part presents the philosophical approach taken in the dissertation. The approach takes Wittgenstein's philosophy, in particular as it has been understood by Rush Rhees, as a model. Emphasis is put on the difference between technical work and philosophical work. Philosophical work starts in the lifeworld and is akin to anthropology. The descriptions needed in this work can be given by considering our language use and by drawing up objects of comparison. It is nonetheless important not to confuse philosophical problems with problems of a purely intellectual character, since problems in philosophy can be described as bearing similarities to moral problems.

    In the second part, which is the main part of the dissertation, the classical theories of computation are considered against the background of the first part. The chapter starts by briefly tracing the historical development of the theories back to Hilbert. It is noted that Hilbert was concerned with epistemological questions. After this, it is investigated how well these epistemological questions were dealt with in the theories of computation that followed. In particular, work by Gödel, Church, and Turing is considered. Topics that are discussed are the very idea of mathematically analysing mathematical activity itself, the concept of finite procedure, what is natural in mathematics, and the idea that computations should be described as transitions between states.

    The third part is about a more recent theory of computation: abstract state machines. It is shown that many of the aspects of the classical theories that were problematic from an epistemological perspective are carried over to the abstract state machines. This includes the notion of state. Other topics are the idea of axiomatising computability, and the use of abstract state machines for proving Church's thesis.

  • 16.
    Solin, Kim
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy, Logic and Metaphysics.
    Vetenskapen är sig själv nog: Quine och naturalismen2017In: Från Skaradjäkne till Uppsalaprofessor: Festskrift till Lars-Göran Johansson i samband med hans pensionering / [ed] George Masterton, Keizo Matsubara, Kim Solin, Uppsala: Dept. of Philosophy, Uppsala University, Sweden , 2017Chapter in book (Other academic)
  • 17.
    Solin, Kim
    et al.
    Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy, Logic and Metaphysics.
    von Wright, Joakim
    Enabledness and termination in refinement algebra2009In: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 74, no 8, p. 654-668Article in journal (Refereed)
    Abstract [en]

    Refinement algebras are abstract algebras for reasoning about programs in a total correctness framework. We extend a reduct of von Wright's demonic refinement algebra with two operators for modelling enabledness and termination of programs. We show how the operators can be used for expressing relations between programs and apply the algebra to reasoning about action systems.

1 - 17 of 17
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf