• Analyysi 1 

      Koivisto, Pertti
      Informaatiotieteiden yksikön raportteja - Reports in Information Sciences : 46/2016 (Tampereen yliopisto, 2016)
      report
    • Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality 

      Kieronski, Emanuel; Kuusisto, Antti (Tampereen yliopisto, 2014)
      book
      Uniform one-dimensional fragment UF is a formalism obtained from first-order logic by limiting quantification to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in ...
    • Deduction Systems for Multimodal Logics with Operations on Modalities 

      Kuusisto, Antti (Tampereen yliopisto, 2007)
      book
      This article is a brief, user friendly discourse on extensions of multi- modal logics with operations on modalities. Such logics are considered from a general point of view with the emphasis on the theory of deduc- tion ...
    • Defining a Double Team Semantics for Generalized Quantifiers 

      Kuusisto, Antti (Tampereen yliopisto, 2012)
      book
      In this brief technical report we sketch a semantics for fi rst-order logic with generalized quantifiers based on double teams. We also define the notion of a generalized atom. Such atoms can be used in order to define ...
    • Defining a Double Team Semantics for Generalized Quantifiers (Extended Version) 

      Kuusisto, Antti (Tampereen yliopisto, 2013)
      book
      In this brief technical report we sketch a semantics for first-order logic with generalized quantifi ers based on double teams. We also defi ne the notion of a generalized atom. Such atoms can be used in order to defi ne ...
    • Infinite networks, halting and local algorithms (Draft) 

      Kuusisto, Antti (2013)
      book
      The immediate past has witnessed an increasing amount of interest in local algorithms, i.e., constant time distributed graph algorithms. In the recent survey of local algorithms (Suomela, ACM Computing Surveys, 2013), it ...
    • Insights into Modal Slash Logic and Modal Decidability 

      Tulenheimo, Tero
      Reports in Information Sciences : 6 / 2012 (Tampereen yliopisto, 2012)
      report
      The present paper has a two-fold task. On the one hand, it aims to provide an overview on Independence friendly modal logic as defined in (Tulenheimo, 2003; Tulenheimo, 2004) and studied in a number of subsequent publications. ...
    • Logics of Imperfect Information without Identity 

      Kuusisto, Antti (2011)
      book
      We investigate the expressive power of sentences of the family of independence friendly (IF) logics in the equality-free setting. Various natural equality-free fragments of logics in this family translate into the version ...
    • Modal Logic and Distributed Message Passing Automata (Preliminary Draft) 

      Kuusisto, Antti (2013)
      book
      In a recent article, Lauri Hella and co-authors identify a canonical connection between modal logic and deterministic distributed constant-time algorithms. The paper reports a variety of highly natural logical characterizations ...
    • Modal Logics and Definability 

      Kuusisto, Antti (2013)
      book
      In recent years, research into the mathematical foundations of modal logic has become increasingly popular. One of the main reasons for this is the fact that modal logic seems to adapt well to the requirements of a wide ...
    • On eigenvalues of meet and join matrices associated with incidence functions 

      Ilmonen, Pauliina; Haukkanen, Pentti (2007)
      book
      In this paper we give lower bounds for the smallest eigenvalues of certain positive definite meet matrices with respect to f on any set S. We also estimate eigenvalues of meet matrices respect to any f on meet closed set ...
    • Resource Conscious Quantification and Ontologies with Degrees of Significance 

      Kuusisto, Antti (Tampereen yliopisto, 2010)
      book
      We discuss formal ontologies where objects can be ranked according to the modes of existence they are associated with. Mathematical objects, for instance, may be ranked according to how admissible they are; it is natural ...