Abstract. We show that any variety of groups that contains a finite nonsolvable group contains an axiomatic formation that is not a subvariety. 1.

In this paper, we introduce an extension of the GSOS rule format with predicates such as termination, convergence and divergence. For this format we generalize the technique proposed by Aceto, Bloom and Vaandrager for the automatic generation of ground-complete axiomatizations of bisimilarity over

known so far. Key words: Structured operational semantics, GSOS format, equational theories, bisimulation equivalence, complete axiomatizations, approximation induction principle 1

Hyperuniverses are topological structures exhibiting strong closure properties under formation of subsets. They have been used both in Computer Science, for giving denotational semantics `a la Scott-de Bakker, and in Mathematical Logic, in order to show the consistency of set theories which do

? Within this framework, we axiomatically study the formation and structures of communities in two different ways. First, we apply social choice theory and define communities indirectly by postulating that they are fixed points of a preference aggregation function obeying certain desirable axioms. Second

foundations of a link prediction function are often left informal—each func-tion contains implicit assumptions about the dynamics of link formation, and about structural properties that result from these dynamics. We draw upon the motivation used in characterizations of ranking algorithms, as well as other

syntactically. In particular, the concept of Axiomatic Type Classes provides a useful light-weight mechanism for hierarchically-structured abstract theories. Subsequently, we demonstrate typical uses of Isabelle's axiomatic type classes to model basic algebraic structures. This document describes axiomatic

1 Introduction --- The Debate over Axiomatic Truths and Nature 1 2 Self-Organisation from a State of Maximum Entropy 2 2.1 "Reverse-Entropy" as a Name for Self-Organisation . . . . . . . . 3 3 Spontaneous Structure Formation in the Early Universe 3 4 Paradoxes in "

Non-Axiomatic Reasoning System (NARS) is an intelligent reasoning system, where intelligence means working and adapting with insu cient knowledge and resources. NARS uses a new form of term logic, or an extended syllogism, in which several types of uncertainties can be represented and processed

. Also, where the compiler writes binary files of static type information that must then be read in by the bootstrapped interactive compiler, how can one ever change the format of digested type information in binary files? Here I attempt an axiomatic clarification of the bootstrapping technique. I use