848 research outputs found
Coopetitive value creation in entrepreneurial contexts: the case of AlmaCube
No full textIn the burgeoning coopetition strategy literature, scarce attention has been paid so far to the role of coopetitive system of value creation in entrepreneurial contexts. With the aim of epitomizing a coopetitive system of value creation, we draw attention to the fact that coopetition does not simply emerge from coupling competition and cooperation issues, but it rather implies that cooperation and competition merge together to form a new kind of strategic interdependence between firms. Accordingly, coopetition strategy concerns interfirm strategy that allows the firms involved to manage a partially convergent interest and goal structure and to create value by means of coopetitive advantage.
Drawing on a parsimonious set of theoretical antecedents (Dagnino and Padula, 2002; Dagnino and Mariani, 2007; Padula and Dagnino, 2007), this paper elaborates a comprehensive framework where the emergence of coopetition is linked to the configuration process of entrepreneurial strategies. In more detail, the paper focuses on the strategic role of the entrepreneurial firm in bridging the gap between the capability space and the opportunity space, by characterizing entrepreneurial coopetitive strategies according to the required objectives of execution vs innovation. Consequently, we show how coopetition can be the appropriate blaze to spark value creation in entrepreneurial contexts, where entrepreneurial firms have to select their strategic courses of action by capturing the right and well-timed opportunities frequently making use of limited capability base. Finally, the notion of coopetitive analysis, where the actors involved interact coopetitively, is introduced and illustrated as an appealing tool effective to recognize the potential for creating and sustaining coopetitive advantage in shifting entrepreneurial contexts. A few business mini-cases, where coopetition emerges in a variety of entrepreneurial contexts, illustrate how coopetitive analysis can be supportive of entrepreneurial strategies under the budding regìme of coopetition
Foundations of regular coinduction
No full textInference systems are a widespread framework used to define possibly
recursive predicates by means of inference rules. They allow both inductive and
coinductive interpretations that are fairly well-studied. In this paper, we
consider a middle way interpretation, called regular, which combines advantages
of both approaches: it allows non-well-founded reasoning while being finite. We
show that the natural proof-theoretic definition of the regular interpretation,
based on regular trees, coincides with a rational fixed point. Then, we provide
an equivalent inductive characterization, which leads to an algorithm which
looks for a regular derivation of a judgment. Relying on these results, we
define proof techniques for regular reasoning: the regular coinduction
principle, to prove completeness, and an inductive technique to prove
soundness, based on the inductive characterization of the regular
interpretation. Finally, we show the regular approach can be smoothly extended
to inference systems with corules, a recently introduced, generalised
framework, which allows one to refine the coinductive interpretation, proving
that also this flexible regular interpretation admits an equivalent inductive
characterisation
Coaxioms: flexible coinductive definitions by inference systems
No full textWe introduce a generalized notion of inference system to support more
flexible interpretations of recursive definitions. Besides axioms and inference
rules with the usual meaning, we allow also coaxioms, which are, intuitively,
axioms which can only be applied "at infinite depth" in a proof tree. Coaxioms
allow us to interpret recursive definitions as fixed points which are not
necessarily the least, nor the greatest one, whose existence is guaranteed by a
smooth extension of classical results. This notion nicely subsumes standard
inference systems and their inductive and coinductive interpretation, thus
allowing formal reasoning in cases where the inductive and coinductive
interpretation do not provide the intended meaning, but are rather mixed
together.
This is a corrected version of the paper (arXiv:1808.02943v4)
published originally on 12 March 201
Coopetition strategies: toward a new form of inter-organizational dynamics
No full textNo abstract availabl
Flexible coinduction for infinite behaviour
No full textGeneralized inference systems have been recently defined to overcome the strong dichotomy between inductive and coinductive interpretations. They support a flexible form of coinduction, subsuming even induction, which allows one to mediate between the two standard semantics. Recently, this framework has been successfully adopted to define semantic judgments which uniformly model finite and infinite computations. In this communication, we survey these results and outline directions for further developments
QUANTITATIVE EQUALITY IN SUBSTRUCTURAL LOGIC VIA LIPSCHITZ DOCTRINES
No full textSubstructural logics naturally support a quantitative interpretation of formulas, as they are seen as consumable resources. Distances are the quantitative counterpart of equivalence relations: they measure how much two objects are similar, rather than just saying whether they are equivalent or not. Hence, they provide the natural choice for modelling equality in a substructural setting. In this paper, we develop this idea, using the categorical language of Lawvere’s doctrines. We work in a minimal fragment of Linear Logic enriched by graded modalities, which are needed to write a resource sensitive substitution rule for equality, enabling its quantitative interpretation as a distance. We introduce both a deductive calculus and the notion of Lipschitz doctrine to give it a sound and complete categorical semantics. The study of 2-categorical properties of Lipschitz doctrines provides us with a universal construction, which generates examples based for instance on metric spaces and quantitative realisability. Finally, we show how to smoothly extend our results to richer substructural logics, up to full Linear Logic with quantifiers
Logical Foundations of Qantitative Equality
No full textIn quantitative reasoning one compares objects by distances, instead
of equivalence relations, so that one can measure how much they
are similar, rather than just saying whether they are equivalent or
not. In this paper we aim at providing a logical ground to quantitative reasoning with distances in Linear Logic, using the categorical
language of Lawvere’s doctrines. The key idea is to see distances
as equality predicates in Linear Logic. We use graded modalities to
write a resource sensitive substitution rule for equality, which allows us to give it a quantitative meaning by distances. We introduce
a deductive calculus for (Graded) Linear Logic with quantitative
equality and the notion of Lipschitz doctrine to give it a sound and
complete categorical semantics. We also describe a universal con-
struction of Lipschitz doctrines, which generates examples based
for instance on metric spaces and quantitative realisability
CAUCHY COMPLETIONS AND THE RULE OF UNIQUE CHOICE IN RELATIONAL DOCTRINES
No full textLawvere’s generalized the notion of complete metric space to the field of enriched categories: an enriched category is said to be Cauchy-complete if every left adjoint bimodule into it is represented by an enriched functor. Looking at this definition from a logical standpoint, regarding bimodules as an abstraction of relations and functors as an abstraction of functions, Cauchy-completeness resembles a formulation of the rule of unique choice. In this paper, we make this analogy precise, using the language of relational doctrines, a categorical tool that provides a functorial description of the calculus of relations, in the same way Lawvere’s hyperdoctrines give a functorial description of predicate logic. Given a relational doctrine, we define Cauchy-complete objects as those objects of the domain category satisfying the rule of unique choice. Then, we present a universal construction that completes a relational doctrine with the rule of unique choice, that is, producing a new relational doctrine where all objects are Cauchy-complete. We also introduce relational doctrines with singleton objects and show that these have the minimal structure needed to build the reflector of the full subcategory of its domain on Cauchy-complete objects. The main result is that this reflector exists if and only if the relational doctrine has singleton objects and this happens if and only if its restriction to Cauchy-complete objects is equivalent to its completion with the rule of unique choice. We support our results with many examples, also falling outside the scope of standard doctrines, such as complete metric spaces, Banach spaces and compact Hausdorff spaces in the general context of monoidal topology, which are all shown to be Cauchy-complete objects for appropriate relational doctrines
- …
