Recent research illustrates substantial gaps between entrepreneurial intentions and behavior. This is a challenge for entrepreneurship promotion interventions that have primarily focused on stimulating entrepreneurial intentions. However, extant literature suggests that implementation intentions enhance the likelihood of acting congruently to the behavioral intention. Furthermore, theory also suggests the condition effects of situations and the perceived control over them. We therefore hypothesized that implementation intentions mediate the relationship between entrepreneurial intention and action, while perceived family support moderates the movement from implementation (...) intention to entrepreneurial action. Using two-wave survey data from a sample of students at an African university, we measured two psychological attributes as important precursors of entrepreneurship and entrepreneurial intentions present before undertaking an innovations and entrepreneurship course. Implementation intentions regarding entrepreneurship, entrepreneurial actions, and perceived parental support for entrepreneurial activities were also measured 2 weeks after completion of the course. Our results demonstrate support for the proposed moderated double mediation model in which the effects of the two psychological attributes on entrepreneurial actions are explained via entrepreneurial intentions and implementation intentions. We further find moderation effects of perceived family support indicating that implementation intentions more likely predicted entrepreneurial actions in cases of higher family support. (shrink)

Entrepreneurship education is increasingly becoming a focal strategy for promoting entrepreneurship, particularly to foster entrepreneurial intentions and startups. However, learning and support are equally important after startup for novice entrepreneurs to gain a good level of confidence to manage their business and achieve the desired outcomes. Using a sample of 189 young self-employed individuals in Uganda, this study examines the differential impact of mentoring and self-efficacy on the achievement of intangible outcomes of entrepreneurship including satisfaction of need for autonomy, work (...) satisfaction and the intention to stay in self-employment. We found self-efficacy to mediate the effects of mentoring on these intangible outcomes. In addition, the results showed substantial gender differences. Whereas women’s satisfaction of the need for autonomy and intention to stay in self-employment were strongly associated with the direct effects of mentoring, their male counterparts seemed to benefit more if mentoring resulted in increased self-efficacy. Overall, our findings suggest that whereas mentoring improves the competence of small business owners and consequently achievement of superior outcomes, mentoring should also focus on boosting self-efficacy which in turn is essential for the application of the entrepreneurial competencies. (shrink)

In this article I try to investigate the possible insights one may reach by considering the development on the level of socio-philosophical theories as a symptom of the development taking place on the level of social practice.

We explore the finite model theory of the characterisation theorems for modal and guarded fragments of first-order logic over transition systems and relational structures of width two. A new construction of locally acyclic bisimilar covers provides a useful analogue of the well known tree-like unravellings that can be used for the purposes of finite model theory. Together with various other finitary bisimulation respecting model transformations, and Ehrenfeucht–Fraïssé game arguments, these covers allow us to upgrade finite approximations for full bisimulation equivalence (...) towards approximations for elementary equivalence. These techniques are used to prove several ramifications of the van Benthem–Rosen characterisation theorem of basic modal logic for refinements of ordinary bisimulation equivalence, both in the sense of classical and of finite model theory. (shrink)

How can we prove that some fragment of a given logic has the power to define precisely all structural properties that satisfy some characteristic semantic preservation condition? This issue is a fundamental one for classical model theory and applications in non-classical settings alike. While methods differ greatly, and while the classical methods can usually not be matched for instance in the setting of finite model theory, this note surveys some interesting commonality revolving around the use and availability of tractable representatives (...) in the relevant model classes. The construction of models in which simple invariants like partial types based on some weak fragment control all the relevant structural properties, may be seen at the heart of such questions. We highlight some constructions involving degrees of acyclicity and saturation that can be achieved in finite model constructions, and discuss their uses towards expressive completeness w.r.t. bisimulation based equivalences in hypergraphs and relational structures. The emphasis is on the combinatorial challenges in such more constructive approaches that work in non-classical settings and especially in finite model theory. One new result concerns expressive completeness w.r.t. guarded negation bisimulation, a back-and-forth equivalence involving local homomorphisms. (shrink)

Much research has been done on the economic effects of self-employment, environmental conditions for entrepreneurial success, as well as attributes if the person him-/herself fits to this career path. To successfully run a business, however, is contingent on the health of the entrepreneur. In particular, small business owners (being solo self-employed without personnel) face financial uncertainties, a high workload, long working hours, and are often unable to call in sick. This study aimed at exploring the working situation considering resources (e.g., (...) autonomy), strain (e.g., dependency on contracts with clients) and health and career outcomes of small business owners. This study used a qualitative approach to comprehensively mirror the working situation. Participants who were 29 small business owners from Germany gave permission for recording expert interviews in which they reported, for example, on health complaints, recovery opportunities, obstacles and resources while running their businesses. The interviews emphasize the meaning of active actions and own responsibility for creating working conditions and enabling autonomy. Small business owners yet have to be able to use the autonomy. Besides personal preferences regarding the career path as being pulled into self-employment and not pushed by situational circumstances also marketability and flexibility played a role and explained health and career issues. Our findings underline that the social network is of utmost importance to small business owners and that social support – even or despite of being solo self-employed – is a key to sustaining health and satisfaction. As voluntariness played an essential role for selecting this specific career path those being pulled into self-employment as no other jobs are available should receive particular support through career counseling. One shortcoming of prior research is that the concrete working situation of small business owners and its impact on health and career has not adequately been taken into account. Based on work-related stress models we developed a frame model specific for the situation of small business owners which allows concrete hypotheses for further quantitative research. (shrink)

The satisfiability problem for the two-variable fragment of first-order logic is investigated over finite and infinite linearly ordered, respectively wellordered domains, as well as over finite and infinite domains in which one or several designated binary predicates are interpreted as arbitrary wellfounded relations. It is shown that FO 2 over ordered, respectively wellordered, domains or in the presence of one well-founded relation, is decidable for satisfiability as well as for finite satisfiability. Actually the complexity of these decision problems is essentially (...) the same as for plain unconstrained FO 2 , namely non-deterministic exponential time. In contrast FO 2 becomes undecidable for satisfiability and for finite satisfiability, if a sufficiently large number of predicates are required to be interpreted as orderings, wellorderings, or as arbitrary wellfounded relations. This undecidability result also entails the undecidability of the natural common extension of FO 2 and computation tree logic CTL. (shrink)

We study the expressive power in the finite of the logic Fixed-Point+Counting, the extension of first-order logic which is obtained through adding both the fixed-point constructor and the ability to count. To this end an isomorphism preserving (`generic') model of computation is introduced whose PTime restriction exactly corresponds to this level of expressive power, while its PSpace restriction corresponds to While+Counting. From this model we obtain a normal form which shows a rather clear separation of the relational vs. the arithmetical (...) side of the algorithms involved. In parallel, we study the relations of Fixed-Point+Counting with the infinitary logics L r ∞ω (∃ ≥ m ) m∈ω and the corresponding pebble games. The main result, however, involves the concept of an arithmetical invariant. By this we mean a functor taking every finite relational structure to an expansion of (an initial segment of) the standard arithmetical structure. In particular its values are linearly ordered structures. We establish the existence of a family of arithmetical invariants (J r ) r≥ 1 with the following properties: $\bullet$ The invariants themselves can be evaluated in polynomial time. $\bullet$ A class of finite relational structures is definable in Fixed-Point+Counting if and only if membership can be decided in polynomial time on the basis of the values of one of the invariants. $\bullet$ The invariant J r classifies all finite relational structures exactly up to equivalence with respect to the logic L r ∞ω (∃ ≥ m ) m∈ω . We also give a characterization of Fixed-Point+Counting in terms of sequences of formulae in the L r ωω (∃ ≥ m ) m∈ω : It corresponds exactly to the polynomial time computable families (φ n ) n∈ω in these logics. Towards a positive assessment of the expressive power of Fixed-Point+Counting, it is shown that the natural extension of fixed-point logic by Lindström quantifiers, which capture all the PTime computable properties of cardinalities of definable predicates, is strictly weaker than what we get here. This implies in particular that every extension of fixed-point logic by means of monadic Lindstrom quantifiers, which stays within PTime, must be strictly contained in Fixed-Point+Counting. (shrink)

Lyndon's Interpolation Theorem asserts that for any valid implication between two purely relational sentences of first-order logic, there is an interpolant in which each relation symbol appears positively (negatively) only if it appears positively (negatively) in both the antecedent and the succedent of the given implication. We prove a similar, more general interpolation result with the additional requirement that, for some fixed tuple U of unary predicates U, all formulae under consideration have all quantifiers explicitly relativised to one of the (...) U. Under this stipulation, existential (universal) quantification over U contributes a positive (negative) occurrence of U. It is shown how this single new interpolation theorem, obtained by a canonical and rather elementary model theoretic proof, unifies a number of related results: the classical characterisation theorems concerning extensions (substructures) with those concerning monotonicity, as well as a many-sorted interpolation theorem focusing on positive vs. negative occurrences of predicates and on existentially vs. universally quantified sorts. (shrink)

We consider infinitary logic with only two variable symbols, both with and without counting quantifiers, i.e. L2 L∞ω2 and C2 L∞ω2mεω. The main result is that finite relational structures admit canonization with respect to L2 and C2: there are polynomial time com putable functors mapping finite relational structures to unique representatives of their equivalence class with respect to indistinguishability in either of these logics. In fact we exhibit in verses to the natural invariants that characterize structures up to L2- or (...) C2-equivalence, respectively. As a corollary we obtain recursive presentations of the classes of all boolean queries that are closed with respect to L2- or C2-equivalence. (shrink)

There are properties of finite structures that are expressible with the use of Hilbert's ε-operator in a manner that does not depend on the actual interpretation for ε-terms, but not expressible in plain first-order. This observation strengthens a corresponding result of Gurevich, concerning the invariant use of an auxiliary ordering in first-order logic over finite structures. The present result also implies that certain non-deterministic choice constructs, which have been considered in database theory, properly enhance the expressive power of first-order logic (...) even as far as deterministic queries are concerned, thereby answering a question raised by Abiteboul and Vianu. (shrink)

By means of an Ehrenfeucht-Mostowski construction we obtain an automorphism theorem for a syntactically characterized class of Laa-theories comprising in particular the finitely determinate ones. Examples of Laa-theories with only rigid models show this result to be optimal with respect to a classification in terms of prenex quantifier type: Rigidity is seen to hinge on quantification of type $\ldots\forall\ldots\mathbf{\operatorname{stat}}\ldots$ permitting of the parametrization of families of disjoint stationary systems by the elements of the universe.

We consider a class of Lindström extensions of first-order logic which are susceptible to a natural Skolemization procedure. In these logics Ehrenfeucht Mostowski (EM) functors for theories with arbitrarily large models can be obtained under suitable restrictions. Characteristic dependencies between algebraic properties of the quantifiers and the maximal domains of EM functors are investigated.Results are applied to Magidor Malitz logic,L(Q <ω), showing e.g. its Hanf number to be equal to ℶω(ℵ1) in the countably compact case. Using results of Baumgartner, the (...) maximal number of isomorphism types of linearly ordered models of regular cardinality is shown to be achieved for theories that admit an EM functor on a typically restricted domain. (shrink)

We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthem’s theorem, which says that a first-order formula is invariant under bisimulation if, and only if, it is equivalent to a formula of basic modal logic. The present investigation primarily concerns ramifications for specific classes of structures. We study in particular model classes defined through conditions on the underlying frames, with a focus on frame classes (...) that play a major role in modal correspondence theory and often correspond to typical application domains of modal logics. Classical model theoretic arguments do not apply to many of the most interesting classes–for instance, rooted frames, finite rooted frames, finite transitive frames, well-founded transitive frames, finite equivalence frames–as these are not elementary. Instead we develop and extend the game-based analysis over such classes and provide bisimulation preserving model constructions within these classes. Over most of the classes considered, we obtain finite model theory analogues of the classically expected characterisations, with new proofs also for the classical setting. The class of transitive frames is a notable exception, with a marked difference between the classical and the finite model theory of bisimulation invariant first-order properties. Over the class of all finite transitive frames in particular, we find that monadic second-order logic is no more expressive than first-order as far as bisimulation invariant properties are concerned — though both are more expressive here than basic modal logic. We obtain ramifications of the de Jongh–Sambin theorem and a new and specific analogue of the Janin–Walukiewicz characterisation of bisimulation invariant monadic second-order for finite transitive frames. (shrink)

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in the direction of monadic second-order logic, as inquisitive modal operators involve quantification over sets of worlds. We introduce and investigate (...) the natural notion of bisimulation equivalence in the setting of InqML. We compare the expressiveness of InqML and first-order logic in the context of relational structures with two sorts, one for worlds and one for information states, and characterise inquisitive modal logic as the bisimulation invariant fragment of first-order logic over various natural classes of two-sorted structures. (shrink)

We present a natural standard translation of inquisitive modal logic $\mathrm{InqML}$ into first-order logic over the natural two-sorted relational representations of the intended models, which captures the built-in higher-order features of $\mathrm{InqML}$. This translation is based on a graded notion of flatness that ties the inherent second-order, team-semantic features of $\mathrm{InqML}$ over information states to subsets or tuples of bounded size. A natural notion of pseudo-models, which relaxes the non-elementary constraints on the intended models, gives rise to an elementary, purely (...) model-theoretic proof of the compactness property for $\mathrm{InqML}$. Moreover, we prove a Hennessy-Milner theorem for $\mathrm{InqML}$, which crucially uses $\omega $ -saturated pseudo-models and the new standard translation. As corollaries we also obtain van Benthem style characterisation theorems. (shrink)

It is a classical result of Mortimer that $L^2$ , first-order logic with two variables, is decidable for satisfiability. We show that going beyond $L^2$ by adding any one of the following leads to an undecidable logic:– very weak forms of recursion, viz.¶(i) transitive closure operations¶(ii) (restricted) monadic fixed-point operations¶– weak access to cardinalities, through the Härtig (or equicardinality) quantifier¶– a choice construct known as Hilbert's $\epsilon$ -operator.In fact all these extensions of $L^2$ prove to be undecidable both for satisfiability, (...) and for satisfiability in finite structures. Moreover most of them are hard for $\Sigma^1_1$ , the first level of the analytical hierachy, and thus have a much higher degree of undecidability than first-order logic. (shrink)

We study first-order logic with two variables FO² and establish a small substructure property. Similar to the small model property for FO² we obtain an exponential size bound on embedded substructures, relative to a fixed surrounding structure that may be infinite. We apply this technique to analyse the satisfiability problem for FO² under constraints that require several binary relations to be interpreted as equivalence relations. With a single equivalence relation, FO² has the finite model property and is complete for non-deterministic (...) exponential time, just as for plain FO² With two equivalence relations, FO² does not have the finite model property, but is shown to be decidable via a construction of regular models that admit finite descriptions even though they may necessarily be infinite. For three or more equivalence relations, FO² is undecidable. (shrink)

We provide a canonical construction of conformal covers for finite hypergraphs and present two immediate applications to the finite model theory of relational structures. In the setting of relational structures, conformal covers serve to construct guarded bisimilar companion structures that avoid all incidental Gaifman cliques-thus serving as a partial analogue in finite model theory for the usually infinite guarded unravellings. In hypergraph theoretic terms, we show that every finite hypergraph admits a bisimilar cover by a finite conformal hypergraph. In terms (...) of relational structures, we show that every finite relational structure admits a guarded bisimilar cover by a finite structure whose Gaifman cliques are guarded. One of our applications answers an open question about a clique constrained strengthening of the extension property for partial automorphisms (EPPA) of Hrushovski, Herwig and Lascar. A second application provides an alternative proof of the finite model property (FMP) for the clique guarded fragment of first-order logic CGF, by reducing (finite) satisfiability in CGF to (finite) satisfiability in the guarded fragment, GF. (shrink)

Although the body of literature in sport science is growing rapidly, certain sports have yet to benefit from this increased interest by the scientific community. One such sport is Ultimate Frisbee, officially known as Ultimate. Thus, the goal of this study was to describe the nature of the sport by identifying differences between winning and losing teams in elite-level competition. To do so, a customized observational system and a state transition model were developed and applied to 14 games from the (...) 2017 American Ultimate Disc League season. The results reveal that, on average, 262.2 passes were completed by a team per game and 5.5 passes per possession. More than two-thirds of these passes were played from the mid zone and the rear zone, nearest the team’s own end zone. Winning and losing teams do not differ in these general patterns, but winning teams played significantly fewer backward passes from the front zone to the mid zone, nearest the opponent’s end zone than losing teams = −4.980, p < 0.001, d = −1.16). Furthermore, losing teams scored fewer points when they started on defense, called breakpoints = −6.365, p < 0.001, d = 2.30), and committed significantly more turnovers per game = 5.85, p < 0.001, d = −1.18). Overall, this study provides the first empirical description of Ultimate and identifies relevant performance indicators to discriminate between winning and losing teams. We hope this article sheds light on the unique, but so far overlooked sport of Ultimate, and offers performance analysts the basis for future studies using state transition modeling in Ultimate as well as other invasion sports. (shrink)

Consider the bounded variable logics $L^k_{\infty\omega}$ (with k variable symbols), and $C^k_{\infty\omega}$ (with k variables in the presence of counting quantifiers $\exists^{\geq m}$ ). These fragments of infinitary logic $L_{\infty\omega}$ are well known to provide an adequate logical framework for some important issues in finite model theory. This paper deals with a translation that associates equivalence of structures in the k-variable fragments with bisimulation equivalence between derived structures. Apart from a uniform and intuitively appealing treatment of these equivalences, this approach (...) relates some interesting issues for the case of an arbitrary number of variables to the case of just three variables. Invertibility of the invariants for $\equiv_{C^3}$ , in particular, would imply a positive answer to the tempting conjecture that fixed-point logic with counting captures $\bigcup_k$ Ptime $\cap C^k_{\infty\omega}$. (shrink)

Otto Friedrich Bollnow (1903-1991), Philosoph und Pädagoge, ist aus der Göttinger Dilthey-Schule hervorgegangen. Geprägt durch Jugendbewegung und Reformpädagogik des frühen 20. Jahrhunderts sowie durch ein Studium bei Martin Heidegger, blieb sein Denken zeitlebens bestimmt von der Spannung zwischen Lebensphilosophie und Existenzphilosophie sowie den Versuchen, hermeneutische und anthropologisch-phänomenologische Ansätze für Philosophie und Pädagogik fruchtbar zu machen. Die dritte Gruppe der Schriften innerhalb der Studienausgabe enthält Bollnows systematische Arbeiten zur Pädagogik. Existenzphilosophie und Pädagogik (1959), eines der bekanntesten Bücher Bollnows, untersucht (...) "unstetige Formen der Erziehung", wie Krise, Erweckung, Ermahnung, Appell und Beratung. Zentrum des Buches ist die ausführliche Behandlung des Begriffs der Begegnung, die auch das Verhältnis von Begegnung und Bildung einbezieht. Krise und neuer Anfang (1966) enthält eine Sammlung von Vorträgen zu ausgewählten Themen der pädagogischen Anthropologie, beispielsweise Die menschliche Bedeutung von Krise und Kritik, Der neue Anfang und das Problem der Verjüngung sowie Sicherheit und Frieden als Aufgabe der Erziehung. (shrink)

Bruder im Geiste - Heidegger trifft Holderlin" erzahlt auf unterhaltsame Weise von einem Philosophen, der sich seinen Dichter nahm. Martin Heidegger, nach wie vor einer der Umstrittenen hierzulande, erklart Holderlin zum "Dichter der Dichter". Dies ist nicht im Sinne einer Rangfolge gemeint, sondern zeichnet die Hellsichtigkeit eines Dichters aus, der sich ins Freie vorwagt. Was er dort schaut und empfangt, kommt auch dem Denker zu, der dafur andere, weniger poetische Worte finden muss. Der Dichter spricht die Sache des Denkers (...) an, der Denker versucht der Sprache des Dichters auf den Grund zu gehen. Beide muhen sich im Sinne eines Auftrags, der vor unvordenklichen Zeiten ergangen sein muss und der uber den irdischen Geschaftsbetrieb hinausweist. Holderlin hat diesen Auftrag als Dichter wahrgenommen; Heidegger ist ihm als Denker nachgekommen, der die Vielfalt des Seienden zurucklasst, um zum Sein aufzubrechen. (shrink)