Since 1993, when Hudelmaier developed an O(n log n)-space decision procedure for propositional Intuitionistic Logic, a lot of work has been done to improve the efficiency of the related proof-search algorithms. In this paper a tableau calculus using the signs T, F and Fc with a new set of rules to treat signed formulas of the kind T((A → B) → C) is provided. The main feature of the calculus is the reduction of both the non-determinism in proof-search (...) and the width of proofs with respect to Hudelmaier's one. These improvements have a significant influence on the performances of the implementation. (shrink)

We introduce a substructural propositional calculus of Sequential Dynamic Logic that subsumes a propositional part of dynamic predicate logic, and is shown to be expressively equivalent to propositional dynamic logic. Completeness of the calculus with respect to the intended relational semantics is established.

We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized (...) with formal grammars, and which encode certain frame conditions expressible as first-order Horn formulae that correspond to a subclass of the Scott-Lemmon axioms. We show that our nested systems are sound, cut-free complete, and admit hp-admissibility of typical structural rules. (shrink)

The constructions of sequential calculi are based on the idea of application to the deduction process not only single logical constants but complexes of them as well. Surely, making use of this idea is not obligatory in paraconsistent logic. Nevertheless, using it in this field gives us a convenient tool for seeking proofs in formulation of many paraconsistent logics. Each of sequential propositional logics discussed in this paper is obtained as a result of a transformation of a starting (...) calculus GCL – one of sequential formalizations of classical propositional logic. Let α be a standard propositional language with a vocabulary {p1, p2, p3, . . . , −,∨, &, ⊃,¬,), we shall denote any formulas of α and by the letters Γ,∆, Σ, Θ finite sets of α-formulas. (shrink)

This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable (...) proof-theoretic properties from its associated labelled calculus. (shrink)

The modal -calculus extends basic modal logic with second-order quantification in terms of arbitrarily nested fixpoint operators. Its satisfiability problem is EXPTIME-complete. Decision procedures for the modal -calculus are not easy to obtain though since the arbitrary nesting of fixpoint constructs requires some combinatorial arguments for showing the well-foundedness of least fixpoint unfoldings. The tableau-based decision procedures so far also make assumptions on the unfoldings of fixpoint formulas, e.g., explicitly require formulas to be in guarded normal form. (...) In this paper we present a tableau calculus for deciding satisfiability of arbitrary, i.e., not necessarily guarded -calculus formulas. It is based on a new unfolding rule for greatest fixpoint formulas which allows unguarded formulas to be handled without an explicit transformation into guarded form, thus avoiding a exponential blow-up in formula size. We prove soundness and completeness of the calculus, and compare it empirically to using guarded transformation instead. The new unfolding rule can also be used to handle nested star operators in PDL formulas correctly. (shrink)

We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, without resorting (...) to embeddings, semantic arguments, or interpreted connectives external to the underlying logical language. A novel feature of our proof includes an orthogonality condition for defining duality between interpolants. (shrink)

We provide a finite axiomatization of the consequence , i.e. of the set of common sequential rules for and . Moreover, we show that has no proper non-trivial strengthenings other than and . A similar result is true for , but not, e.g., for +.

We provide a finite axiomatization of the consequence $\vdash ^{\wedge}\cap \vdash ^{\vee}$ , i.e. of the set of common sequential rules for $\wedge $ and $\vee $ . Moreover, we show that $\vdash ^{\wedge}\cap \vdash ^{\vee}$ has no proper non-trivial strengthenings other than $\vdash ^{\wedge}$ and $\vdash ^{\vee}$ . A similar result is true for $\vdash ^{\leftrightarrow}\cap \vdash ^{\rightarrow}$ , but not, e.g., for $\vdash ^{\leftrightarrow}\cap \vdash ^{+}$.

Standpoint logic is a recently proposed formalism in the context of knowledge integration, which advocates a multi-perspective approach permitting reasoning with a selection of diverse and possibly conflicting standpoints rather than forcing their unification. In this paper, we introduce nested sequent calculi for propositional standpoint logics---proof systems that manipulate trees whose nodes are multisets of formulae---and show how to automate standpoint reasoning by means of non-deterministic proof-search algorithms. To obtain worst-case complexity-optimal proof-search, we introduce a novel technique in the (...) context of nested sequents, referred to as "coloring," which consists of taking a formula as input, guessing a certain coloring of its subformulae, and then running proof-search in a nested sequent calculus on the colored input. Our technique lets us decide the validity of standpoint formulae in CoNP since proof-search only produces a partial proof relative to each permitted coloring of the input. We show how all partial proofs can be fused together to construct a complete proof when the input is valid, and how certain partial proofs can be transformed into a counter-model when the input is invalid. These "certificates" (i.e. proofs and counter-models) serve as explanations of the (in)validity of the input. (shrink)

We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.

Sequential von Neumann–Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. We show that sequential VM games with countably many actions and continuous utility functions have a sound and complete axiomatization in the situation calculus. This axiomatization allows us to represent game-theoretic reasoning and solution concepts such as Nash equilibrium. We discuss the application of various concepts from VM game theory to the theory of (...) planning and multi-agent interactions, such as representing concurrent actions and using the Baire topology to define continuous payoff functions. (shrink)

Quasi-Boolean modal algebras are quasi-Boolean algebras with a modal operator satisfying the interaction axiom. Sequential quasi-Boolean modal logics and the relational semantics are introduced. Kripke-completeness for some quasi-Boolean modal logics is shown by the canonical model method. We show that every descriptive persistent quasi-Boolean modal logic is canonical. The finite model property of some quasi-Boolean modal logics is proved. A cut-free Gentzen sequent calculus for the minimal quasi-Boolean logic is developed and we show that it has the Craig (...) interpolation property. (shrink)

In the Lambek calculus of order 2 we allow only sequents in which the depth of nesting of implications is limited to 2. We prove that the decision problem of provability in the calculus can be solved in time polynomial in the length of the sequent. A normal form for proofs of second order sequents is defined. It is shown that for every proof there is a normal form proof with the same axioms. With this normal form we (...) can give an algorithm that decides provability of sequents in polynomial time. (shrink)

The paper contains an exposition of some non standard approach to gentzenization of modal logics. The first section is devoted to short discussion of desirable properties of Gentzen systems and the short review of various sequential systems for modal logics. Two non standard, cut-free sequent systems are then presented, both based on the idea of using special modal sequents, in addition to usual ones. First of them, GSC I is well suited for nonsymmetric modal logics The second one, GSC (...) II is devised specially for symmetric, i.e. Blogics. GSC I and GSC II are not different formalizations, from the theoretical point of view GSC I may be seen as a simplification of the more general approach present in GSC II. They are considered separately, mainly because Blogics demand different, and more complicated, strategy in completeness proof, whereas non symmetric logics are easily and uniformly characterised by means of Fitting's Consistency Properties. The weakest modal logic captured by this formalization is minimal regular logic C, but many stronger logics are obtainable by addition of suitable structural rules, which conforms to Do en's methodology. Both variants of GSC satisfy also other, besides cut-freedom, desirable properties. (shrink)

We present a categorical/denotational semantics for the Lambek Syntactic Calculus , indeed for a λlD-typed version Curry-Howard isomorphic to it. The main novelty of our approach is an abstract noncommutative construction with right and left adjoints, called sequential product. It is defined through a hierarchical structure of categories reflecting the implicit permission to sequence expressions and the inductive construction of compound expressions. We claim that Lambek's noncommutative product corresponds to a noncommutative bi-endofunctor into a category, which encloses all (...) categories of such hierarchical structure. A soundness theorem for LSC is shown with respect to this semantical framework. (shrink)

We propose a new sequent calculus for bi intuitionistic logic which sits somewhere between display calculi and traditional sequent calculi by using nested sequents. Our calculus enjoys a simple (purely syntactic) cut elimination proof as do display calculi. But it has an easily derivable variant calculus which is amenable to automated proof search as are (some) traditional sequent calculi. We first present the initial calculus and its cut elimination proof. We then present the derived (...) class='Hi'>calculus, and then present a proof search strategy which allows it to be used for automated proof search. We prove that this search strategy is terminating and complete by showing how it can be used to mimic derivations obtained from an existing calculus GBiInt for bi intuitionistic logic. As far as we know, our new calculus is the first sequent calculus for bi intuitionistic logic which uses no semantic additions like labels, which has a purely syntactic cut elimination proof, and which can be used naturally for backwards proof search. Keywords: Bi-intuitionistic logic, display calculi, proof search. (shrink)

For some modal fixed point logics, there are deductive systems that enjoy syntactic cut-elimination. An early example is the system in Pliuskevicius [15] for LTL. More recent examples are the systems by the authors of this paper for the logic of common knowledge [5] and by Hill and Poggiolesi for PDL[8], which are based on a form of deep inference. These logics can be seen as fragments of the modal mu-calculus. Here we are interested in how far this approach (...) can be pushed in general. To this end, we introduce a nested sequent system with syntactic cut-elimination which is incomplete for the modal mu-calculus, but complete with respect to a restricted language that allows only fixed points of a certain form. This restricted language includes the logic of common knowledge and PDL. There is also a traditional sequent system for the modal mu-calculus by Jäger et al. [9], without a syntactic cut-elimination procedure. We embed that system into ours and vice versa, thus establishing cut-elimination also for the shallow system, when only the restricted language is considered. (shrink)

In this paper, we introduce provability multilattice logic PMLn and multilattice arithmetic MPAn which extends first-order multilattice logic with equality by multilattice versions of Peano axioms. We show that PMLn has the provability interpretation with respect to MPAn and prove the arithmetic completeness theorem for it. We formulate PMLn in the form of a nested sequent calculus and show that cut is admissible in it. We introduce the notion of a provability multilattice and develop algebraic semantics for PMLn (...) on its basis, by the method of Lindenbaum-Tarski algebras we prove the algebraic completeness theorem. We present Kripke semantics for PMLn and establish the Kripke completeness theorem via syntactical and semantic embeddings from PMLn into GL and vice versa. Last but not least, the decidability of PMLn is shown. (shrink)

In this paper, we introduce provability multilattice logic PMLn and multilattice arithmetic MPAn which extends first-order multilattice logic with equality by multilattice versions of Peano axioms. We show that PMLn has the provability interpretation with respect to MPAn and prove the arithmetic completeness theorem for it. We formulate PMLn in the form of a nested sequent calculus and show that cut is admissible in it. We introduce the notion of a provability multilattice and develop algebraic semantics for PMLn (...) on its basis, by the method of Lindenbaum-Tarski algebras we prove the algebraic completeness theorem. We present Kripke semantics for PMLn and establish the Kripke completeness theorem via syntactical and semantic embeddings from PMLn into GL and vice versa. Last but not least, the decidability of PMLn is shown. (shrink)

The present note was prompted by Weber’s approach to proving Cantor’s theorem, i.e., the claim that the cardinality of the power set of a set is always greater than that of the set itself. While I do not contest that his proof succeeds, my point is that he neglects the possibility that by similar methods it can be shown also that no non-empty set satisfies Cantor’s theorem. In this paper unrestricted abstraction based on a cut free Gentzen type sequential (...) calculus will be employed to prove both results. In view of the connection between Priest’s three-valued logic of paradox and cut free Gentzen calculi this, a fortiori, has an impact on any paraconsistent set theory built on Priest’s logic of paradox. (shrink)

Against the backdrop of the frequent comparison of theories of truth in the literature on semantic paradoxes with regard to which inferences and metainferences are deemed valid, this paper develops a novel approach to defining a binary predicate for representing the valid inferences and metainferences of a theory within the theory itself under the assumption that the theory is defined with a classical meta-theory. The aim with the approach is to obtain a tool which facilitates the comparison between a theory (...) and its competitors within the theory itself, thereby expressing the disagreement between the theories within the theories. After discussing what we can and should require of an object-linguistic representation of a theory for that purpose, this paper proposes to restrict the representation of valid metainferences to locally valid metainferences, a requirement which turns out to be \-consistent and conservative over classical first-order arithmetic. This approach is then applied to four theories definable on strong Kleene models using a labelled nested sequent calculus. (shrink)

This thesis is about the metaphysics of logic. I argue against a view I refer to as ‘logical realism’. This is the view that the logical constants represent a particular kind of metaphysical structure, which I dub ‘logico-metaphysical structure’. I argue instead for a more metaphysically lightweight view of logic which I dub ‘logical expressivism’. -/- In the first part of this thesis (Chapters I and II) I argue against a number of arguments that Theodore Sider has given for logical (...) realism. In Chapter I, I present an argument of his to the effect that logico-metaphysical structure provides the only good explanation of the semantic determinacy of the logical constants. I argue that other explanations are possible. In Chapter II, I present another argument of his to the effect that logico-metaphysical structure is something that comes along with ontological realism: the view that there is a non-language-relative fact of the matter about what exists. I argue that the connection between logical and ontological realism is not as close as Sider makes it out to be. -/- In the second part of this thesis (Chapters III – V) I set out a positive view of the logical constants that can explain both why their meanings are semantically determinate, and why they form part of our vocabulary. On that view, the primary bearers of logical structure are propositional attitudes, and the logical constants are in our language as vehicles for the expression of logically complex propositional attitudes. In Chapter III, I set out an expressivist theory of propositional logic. In Chapter IV, I use this theory to explain how the logical connectives end up having determinate meanings. In Chapter V, I extend the expressivist theory to predicate logic. (shrink)

In this article, we explore the extraction of recursive nested structure in the processing of binary sequences. Our aim was to determine whether humans learn the higher-order regularities of a highly simplified input where only sequential-order information marks the hierarchical structure. To this end, we implemented a sequence generated by the Fibonacci grammar in a serial reaction time task. This deterministic grammar generates aperiodic but self-similar sequences. The combination of these two properties allowed us to evaluate hierarchical learning (...) while controlling for the use of low-level strategies like detecting recurring patterns. The deterministic aspect of the grammar allowed us to predict precisely which points in the sequence should be subject to anticipation. Results showed that participants’ pattern of anticipation could not be accounted for by “flat” statistical learning processes and was consistent with them anticipating upcoming points based on hierarchical assumptions. We also found that participants were sensitive to the structure constituency, suggesting that they organized the signal into embedded constituents. We hypothesized that the participants built this structure by merging recursively deterministic transitions. (shrink)

The rational status of the Bayesian calculus for revising likelihoods is compromised by the common but still unfamiliar phenomenon of information distortion. This bias is the distortion in the evaluation of a new datum toward favoring the currently preferred option in a decision or judgment. While the Bayesian calculus requires the independent combination of the prior probability and a new datum, information distortion invalidates such independence (because the prior influences the datum). Although widespread, information distortion has not generally (...) been recognized. First, individuals are not aware when they themselves commit this bias. In addition, it is often hidden in more obvious suboptimal phenomena. Finally, the Bayesian calculus is usually explained only with undistortable data like colored balls drawn randomly. Partly because information distortion is unrecognized by the individuals exhibiting it, no way has been devised for eliminating it. Partial reduction is possible in some situation such as presenting all data simultaneously rather than sequentially with revision after each datum. The potential dangers of information distortion are illustrated for three professional revision tasks: forecasting, predicting consumer choices from internet data, and statistical inference from experimental results. The optimality of the Bayesian calculus competes with people’s natural desire that their belief systems remain coherent in the face of new data. Information distortion provides this coherence by biasing those data toward greater agreement with the currently preferred position – but at the cost of Bayesian optimality. (shrink)

This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that explicitly incorporates (...) the semantics of the associated logic, and such systems typically violate the subformula property to a high degree. By contrast, nested sequent calculi employ a simpler syntax and adhere to a strict reading of the subformula property, making such systems useful in the design of automated reasoning algorithms. However, the downside of the nested sequent paradigm is that a general theory concerning the automated construction of such calculi (as in the labelled setting) is essentially absent, meaning that the construction of nested systems and the confirmation of their properties is usually done on a case-by-case basis. The refinement method connects both paradigms in a fruitful way, by transforming labelled systems into nested (or, refined labelled) systems with the properties of the former preserved throughout the transformation process. To demonstrate the method of refinement and some of its applications, we consider grammar logics, first-order intuitionistic logics, and deontic STIT logics. The introduced refined labelled calculi will be used to provide the first proof-search algorithms for deontic STIT logics. Furthermore, we employ our refined labelled calculi for grammar logics to show that every logic in the class possesses the effective Lyndon interpolation property. (shrink)

Human language, hominin tool production modes, and multimodal communications systems of primates and other animals are currently well-studied for how they display compositionality or combinatoriality. In all cases, the former is defined as a kind of hierarchical nesting and the latter as a lack thereof. In this article, I extend research on combinatoriality and compositionality further to investigations of everyday primate skills. Daily locomotion modes as well as behaviors associated with subsistence practices, hygiene, or body modification rely on the hierarchical (...) nesting of different behavioral and cognitive actions into complex skills. I introduce a scheme which uses hierarchical organization to differentiate combinatorial from compositional skills. Combinatorial skills are defined either as aggregational or linearly hierarchical depending on whether the skill occurs momentarily in space or unfolds sequentially over time. Compositional skills are defined either as nested or interactionally hierarchical depending on whether the skill results in new constructs or in new interactions between existing constructs. The methodology I propose combines epistemological hierarchy theory with data from primatological field research and experimental and comparative psychological research and provides a means to integrate current constructionist and extended views on cognition and action with older research on behavioral logics in psychology and operational chain thinking in anthropology. The approach furthermore synchronizes with ongoing research on teleonomy, intentionality, and creativity. -/- . (shrink)

We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference but otherwise stay very close to Gentzen’s sequent calculus, in particular they enjoy a subformula property in the literal sense. No semantic notions are used inside the proof systems, in particular there is no use of labels. All their rules are invertible and the rules cut, weakening (...) and contraction are admissible. All systems admit a straightforward terminating proof search procedure as well as a syntactic cut elimination procedure. (shrink)

A structure which generalizes formulas by including substitution terms is used to represent proofs in classical logic. These structures, called expansion trees, can be most easily understood as describing a tautologous substitution instance of a theorem. They also provide a computationally useful representation of classical proofs as first-class values. As values they are compact and can easily be manipulated and transformed. For example, we present an explicit transformations between expansion tree proofs and cut-free sequential proofs. A theorem prover which (...) represents proofs using expansion trees can use this transformation to present its proofs in more human-readable form. Also a very simple computation on expansion trees can transform them into Craig-style linear reasoning and into interpolants when they exist. We have chosen a sublogic of the Simple Theory of Types for our classical logic because it elegantly represents substitutions at all finite types through the use of the typed -calculus. Since all the proof-theoretic results we shall study depend heavily on properties of substitutions, using this logic has allowed us to strengthen and extend prior results: we are able to prove a strengthen form of the firstorder interpolation theorem as well as provide a correct description of Skolem functions and the Herbrand Universe. The latter are not straightforward generalization of their first-order definitions. (shrink)

In this brief overview paper, we analyse information flow in the brain. Although Shannon’s information concept, in its pure algebraic form, has made a number of valuable contributions to neuroscience, information dynamics within the brain is not fully captured by its classical description. These additional dynamics consist of self-organisation, interplay of stability/instability, timing of sequential processing, coordination of multiple sequential streams, circular causality between bottom-up and top-down operations, and information creation. Importantly, all of these processes are dynamic, hierarchically (...) nested and correspond to continuous brain state change, even if the external environment remains constant. This is where metastable coordination comes into play. In a metastable regime of brain functioning, as a result of the simultaneous co-existence of tendencies for independence and cooperation, information is continuously created, preserved for some time and then dissipated through the formation of dynamical and nested spatio-temporal coalitions among simple neuronal assemblies and larger coupled conglomerates of them—so-called delocalised operational modules. (shrink)

This paper discusses key conceptual resources for an understanding of coordination processes in team sports. It begins by exploring the action guidance provided by the environment, studied in terms of affordances. When conceptualizing sporting performances in general, we might distinguish social and object affordances, think about the spatial and temporal order of affordances in terms of nested and sequential affordances, and differentiate between global, main, and micro-affordances within an action sequence. In the context of team sports, it is (...) crucial to understand how affordances might be given to a plurality of athletes. For that purpose, the paper defines shared, common, and collective affordances. A distinguishing characteristic of team sports is the key role of collaborative intra-team coordination which take place within a setting of antagonistic team-team interactions. A key proposal from dynamical systems theory is to conceptualize intra-team coordination in terms of synergies. Synergies are emergent systems of several athletes who coordinate their movements to achieve specific performance tasks. Many of the embodied skills that players need to develop to become suitable participants in the coordination processes of sport teams are abilities to participate in dynamic sequences of collective activity. Praxeological approaches have emphasized that training processes in team sports are aimed at transforming athletes into skillful participants in sequences of collective play. Athletes need to develop their ability-to-play-with to become proficient in contributing to the formation of suitable collectives for specific performance tasks. (shrink)

An important lesson that philosophy can learn from the Turing Test and computer science more generally concerns the careful use of the method of Levels of Abstraction (LoA). In this paper, the method is first briefly summarised. The constituents of the method are “observables”, collected together and moderated by predicates restraining their “behaviour”. The resulting collection of sets of observables is called a “gradient of abstractions” and it formalises the minimum consistency conditions that the chosen abstractions must satisfy. Two useful (...) kinds of gradient of abstraction – disjoint and nested – are identified. It is then argued that in any discrete (as distinct from analogue) domain of discourse, a complex phenomenon may be explicated in terms of simple approximations organised together in a gradient of abstractions. Thus, the method replaces, for discrete disciplines, the differential and integral calculus, which form the basis for understanding the complex analogue phenomena of science and engineering. The result formalises an approach that is rather common in computer science but has hitherto found little application in philosophy. So the philosophical value of the method is demonstrated by showing how making the LoA of discourse explicit can be fruitful for phenomenological and conceptual analysis. To this end, the method is applied to the Turing Test, the concept of agenthood, the definition of emergence, the notion of artificial life, quantum observation and decidable observation. It is hoped that this treatment will promote the use of the method in certain areas of the humanities and especially in philosophy. (shrink)

The aim of this paper is to analyze Charles S. Peirce’s so-called “Neglected Argument for the Reality of God”. Peirce formulated the Neglected Argument as a “nest” of three different but sequentially developed arguments. Taken as a whole, the Neglected Argument aims to show that engaging in a religious way of life, adoring and acting in accordance with the hypothesis of God, is a subjective, non-evidentially grounded though naturally founded human reaction, and that it is this (alleged) natural foundation that (...) makes it reasonable to accept the hypothesis of God as it being actually true, thereby grounding a properly religious way of life. I argue that Peirce’s Neglected Argument lacks of any serious apologetic force since it fails to justify, on independent, non-question-begging grounds, the claim that we are all naturally (and thus inevitably) lead to formulate, and later adore and act in accordance with, the hypothesis of God. (shrink)

Games and Decision Making, Second Edition, is a unique blend of decision theory and game theory. From classical optimization to modern game theory, authors Charalambos D. Aliprantis and Subir K. Chakrabarti show the importance of mathematical knowledge in understanding and analyzing issues in decision making. Through an imaginative selection of topics, Aliprantis and Chakrabarti treat decision and game theory as part of one body of knowledge. They move from problems involving the individual decision-maker to progressively more complex problems such as (...) sequential rationality, auctions, and bargaining. By building each chapter on material presented earlier, the authors offer a self-contained and comprehensive treatment of these topics. Successfully class-tested in an advanced undergraduate course at the Krannert School of Management and in a graduate course in economics at Indiana University, Games and Decision Making, Second Edition, is an essential text for advanced undergraduates and graduate students of decision theory and game theory. The book is accessible to students who have a good basic understanding of elementary calculus and probability theory. (shrink)

Research of tutoring in parent-infant interaction has shown that tutors – when presenting some action – modify both their verbal and manual performance for the learner (‘motherese’, ‘motionese’). Investigating the sources and effects of the tutors’ action modifications, we suggest an interactional account of ‘motionese’. Using video-data from a semi-experimental study in which parents taught their 8- to 11-month old infants how to nest a set of differently sized cups, we found that the tutors’ action modifications (in particular: high arches) (...) functioned as an orienting device to guide the infant’s visual attention (gaze). Action modification and the recipient’s gaze can be seen to have a reciprocal sequential relationship and to constitute a constant loop of mutual adjustments. Implications are discussed for developmental research and for robotic ‘Social Learning’. We argue that a robot system could use on-line feedback strategies (e.g. gaze) to pro-actively shape a tutor’s action presentation as it emerges. (shrink)

Neste artigo começo por argumentar que devemos ver o Big Typescript como algo muito diferente de um livro planejado para a publicação. Ele deve ser tomado meramente como uma coleção de observações, que expressam a concepção de Wittgenstein de “gramática” por volta de 1932-33, quando as observações foram reunidas. Em seguida, explico a concepção substancial de “gramática” do BT. Espero tornar claro, nesta segunda parte, que o BT e o Tractatus Logico-Philosophicus são próximos no sentido de que partilham a idéia (...) de que a linguagem tem uma estrutura que opera de acordo com regras fixas de sentido (um cálculo). (shrink)

We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$ sentence of a certain form is provable using E-HA ${}^\omega$ along with the axiom of choice and an independence of premise principle, the sequential form of the statement is provable in the classical system RCA. We obtain this and similar results using applications of modified realizability and (...) the Dialectica interpretation. These results allow us to use techniques of classical reverse mathematics to demonstrate the unprovability of several mathematical principles in subsystems of constructive analysis. (shrink)

In this paper, we present a prenex form theorem for a version of Independence Friendly logic, a logic with imperfect information. Lifting classical results to such logics turns out not to be straightforward, because independence conditions make the formulas sensitive to signalling phenomena. In particular, nested quantification over the same variable is shown to cause problems. For instance, renaming of bound variables may change the interpretations of a formula, there are only restricted quantifier extraction theorems, and slashed connectives cannot (...) be so easily removed. Thus we correct some claims from Hintikka [8], Caicedo & Krynicki [3] and Hodges [11]. We refine definitions, in particular the notion of equivalence, and sharpen preconditions, allowing us to restore those claims, including the prenex form theorem of Caicedo & Krynicki [3], and, as a side result, we obtain an application to Skolem forms of classical formulas. It is a known fact that a complete calculus for IF-logic is impossible, but with our results we establish several quantifier rules that form a partial calculus of equivalence for a general version of IF-logic reflecting general properties of information flow in games. (shrink)

Research of tutoring in parent-infant interaction has shown that tutors – when presenting some action – modify both their verbal and manual performance for the learner (‘motherese’, ‘motionese’). Investigating the sources and effects of the tutors’ action modifications, we suggest an interactional account of ‘motionese’. Using video-data from a semi-experimental study in which parents taught their 8- to 11-month old infants how to nest a set of differently sized cups, we found that the tutors’ action modifications (in particular: high arches) (...) functioned as an orienting device to guide the infant’s visual attention (gaze). Action modification and the recipient’s gaze can be seen to have a reciprocal sequential relationship and to constitute a constant loop of mutual adjustments. Implications are discussed for developmental research and for robotic ‘Social Learning’. We argue that a robot system could use on-line feedback strategies (e.g. gaze) to pro-actively shape a tutor’s action presentation as it emerges. (shrink)

ABSTRACTIn this paper, we present a generalisation of proof simulation procedures for Frege systems by Bonet and Buss to some logics for which the deduction theorem does not hold. In particular, we study the case of finite-valued Łukasiewicz logics. To this end, we provide proof systems and which augment Avron's Frege system HŁuk with nested and general versions of the disjunction elimination rule, respectively. For these systems, we provide upper bounds on speed-ups w.r.t. both the number of steps in (...) proofs and the length of proofs. We also consider Tamminga's natural deduction and Avron's hypersequent calculus GŁuk for 3-valued Łukasiewicz logic and generalise our results considering the disjunction elimination rule to all finite-valued Łukasiewicz logics. (shrink)

In this thesis, I deal with the notions of a condition holding for some proposition and a proposition being true in a certain number of possible worlds. These notions are called propositional quantifiers and numerical modalizers respectively. In each chapter, I attempt to dispose of a system. A system consists of: a language; axioms and rules of inference; and an interpretation. To dispose of a system is to prove its decidability and its consistency and completeness for the given interpretation. I (...) shall, in passing, make applications to de definability, translatability and other topics. In Chapter 1, I consider the system 5SQ. Its language is that of 55 with Q as a fresh unary operator. Its axioms and rules of inference are those for 85 plus the following special axiom-schemes for Q: 1) QA::>MA 2) Q A ::> L V L 3) L ::> 4) Q A ::> L Q A. 'QA' is interpreted as 'A is true in exactly one possible world.' I dispose of the system by showing that every formula in it is equivalent to one in normal form. In Chapter 2 I consider the system S5n. Its language is that of S5 but with the unary operators Qk for each non-negative integer k. Its axioms and rules are those of S5 plus the following special axiom-schemes for Qk: 1) Qk A>~Q1 A, 1˂K 2) Qk A ≡ Vki≡oQi ˄ Qk-I 3) L ˂ 4) Qk A ˂ L Qk A 5) Qo A ≡ L ~ A, 1 ≥ 0, k ≥ 1 ‘Qk A’ is interpreted as 'A is true in exactly k possible worlds.' I dispose of this system by generalising the normal forms of S5Q. In the chapters 3-5, I consider three systems which result from adding propositional quantifiers to S5. The first two systems, S5╥+ and S5╥, contain the usual axioms and rules for quantifiers. The first contains, in addition, the axiom-scheme G = )). The last, S5╥-, results from S5╥ by restricting the Scheme of Specification, viz., A > A, B free for P in A, to formulas B of the propositional calculus. To interpret these systems we must specify which propositions the variable P ranges over. For St╥-, we merely require that if p and q are propositions, then and are also propositions. For S5╥+, we also require that each possible world be describable i.e. that there be a proposition which is true in that world alone. And for S5╥, we require not that each possible world be describable but that there be a proposition which is true in just those possible worlds which are describable. Again, we dispose of the systems by normal forms. This requires that we eliminate quantifiers and nested occurrences of L by adding new symbols to the language. For S5╥+, the operators Qk suffice. For S5╥, the operators Qk suffice. For S5╥, we also require the constant g and a fresh unary operator N. For S5╥-, even greater additions are required. In the last two chapters, 6 and 7, I turn to systems which have essentially the same language as S5╥. However, ‘Qk A' is now interpreted as 'A is true in exactly k possible worlds accessible from the given world.' Different conditions on R, the relation of accessibility, lead to different axioms. In chapter 6 I consider the conditions of reflexivity, symmetry and transitivity, and in Chapter 7 the conditions of being a partial, convergent, total or dense order. I prove consistency and completeness by the method of maximally consistent systems. The method can yield decidability results, but I do not go into the matter. I have, as a rule, not given acknowledgements for well-established results or terminology. The main references are at the end of each chapter. Fuller references are in the bibliography. (shrink)

We consider a simple modal logic whose nonmodal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of axioms corresponding to the characteristic axioms of _T_, _S4_, and _S5_, such logics are useful, as shown in previous work by Baltag, Coecke, and the first author, for encoding and reasoning about information and misinformation in multiagent systems. For the propositional-only fragment of such (...) a dynamic epistemic logic, we present an algebraic semantics, using lattices with agent-indexed families of adjoint pairs of operators, and a cut-free sequent calculus. The calculus exploits operators on sequents, in the style of “nested” or “tree-sequent” calculi; cut-admissibility is shown by constructive syntactic methods. The applicability of the logic is illustrated by reasoning about the muddy children puzzle, for which the calculus is augmented with extra rules to express the facts of the muddy children scenario. (shrink)

The purpose of this article is to present a new theory for fixed points over arithmetic which allows the building up of fixed points in a very nested and entangled way. But in spite of its great expressive power we can show that the proof-theoretic strength of our theory—which is intensional in a meaning to be described below—is characterized by the Feferman–Schütte ordinal Γ0. Our approach is similar to the building up of fixed points over state spaces in the (...) propositional modal μ-calculus. (shrink)

continent. 1.3 (2011): 201-207. “Poetry is experience, linked to a vital approach, to a movement which is accomplished in the serious, purposeful course of life. In order to write a single line, one must have exhausted life.” —Maurice Blanchot (1982, 89) Nikos Karouzos had a communist teacher for a father and an orthodox priest for a grandfather. From his four years up to his high school graduation he was incessantly educated, reading the entire private library of his granddad, comprising mainly (...) the Orthodox Church Fathers and the ancient classics. Later on in his life he sold the library for money, only to buy a little more time before he went broke again: “I carry sorrow like a cage/ I got no birds/ as I come back from her hair/ I see the profit emptied/ cool from terror.” (1993, Ι, 101) Nowadays—and ridiculously recently—we are more than apt to speak of a certain insouciance pertaining to the Greek form of expenditure: expenditure without any type of investment, sometimes not (even) symbolic. In the vaults of the European unconscious, this imprudent stance still conjures a “capital punishment” in the form of de-capitation, reflecting back the fear of excess and the terror of its consequences.1 Thus the Greek way of living is very close to what a stranger could have termed as “the Greek way of dying.” Yet, what is not often understood is that the Greek esprit , the same one that invented the maxim μηδ?ν ?γαν (“nothing in excess”), does not experience death solely as an imminent fear of bankruptcy. For it miraculously combines its unconditional acceptance with the promise of a resurrection that is always there in the scents of Spring, from Dionysus to the orthodox Christ: “Everyone resurrects himself through dying [….] Resurrection is the switching of mortalities.” (2002, 94) Hence, if an entire library was imprudently traded for a plate with seven olives, a sliced tomato and some fresh goat cheese, let us not be fooled: this is not the meal of the pauper, but that of “an aristocrat from God” (1993, II, 491) feeding his eloquent loudmouth, ridiculously cut open in an otherwise rock-solid caput . *** To speak of the Greek experience is to speak about a half-dead language that still utters in life what is seemingly excluded from it and thus forbidden to be talked about: death. Death as anything that is out of this world, as something that will never return . Still, along with an experience of death that recently waned as a worn-out academic fashion, the Greek experience is dead too. Nearly 2300 years of written words separating Homer from the fall of Byzantium equal 500 books on a library traded for money: “I am with the killed. Hence my deepest solitude. I do not feel this tremendous macho society, beyond from the fact that it is a ruthlessly consuming one. It is me who pays all the time .” (2002, 57) Let us do the math and see how much this dealing with the Greek experience is costing the poet and how much dealing with the Greek experience might cost us today. *** “I do not guarantee a single word.” (Karouzos, 1993, II, 454) Through its various dialects and forms, the Greek language speaks through an incessant historical dissemination. Anyone who is aware of this terrifying polymorphy and still calls himself a poet, must stand against a white sheet of paper, pen-in-hand, with a very particular duty: to be as fully inconsistent as possible. In the formally ironic uniqueness of the poem, the poet functions as “a band-aid for lesser and greater antinomies.” (1993, I, 251) Of course these antinomies are not exhausted in language—they are historical, political and, alas, existential. Yet, beyond appearances , it is language that ruthlessly encodes them through history, submitting the poet to the temptation of placing them one next to the other on a single white sheet. The closer their neighboring, the greater the scattering of the writer in the ironic uniqueness of the paper. In a work where poetic license is described as a “freedom-impasse” (2002, 51), this task is undertaken in full conscience of its personal consequences: “what I am interested in is to escape my individuality (envisioning the non-ego) […] Nevertheless, my dissociations never achieve duration.” (2002, 74-75) Hence, though poetry is the “deserted direction of will,” (1998, 62) the stance of the poet is not that of a Nietzschean “great man.”2 Whereas drunkenness provides a thread between the poem and the excess it both presupposes and infuses (“Poetry always enlarges. ‘Drunkenness’ is nothing more than that,” (2002, 85)), whereas language flashes in loudmouth spurts of déraison (“When I am alone I do something else. I utter words. For example, while having my ouzo and listening to music I am most likely capable of randomly shouting ‘Electricity!’” (2002, 138)), the poet never gives in to the double affirmation that would eventually risk the “element of pleasure in discourse.” (2002, 80)” It is exactly because the gap of the antinomies is so vast that poetry is not meant to be written with a hammer. Neither does writing consist in a reevaluation of those elements. In short, poetry is not an affirmation of difference, but the surprising beauty of chiming antinomies. We might never transcend them, but it is up to us to put them together. Yet again, this voisinage is not to be identified with the necessity of chance as an eternal return.4 On the contrary it is a return from that very return : Let us treat Yes as a No to No and No as a Yes […] And let us not forget that this pissed affirmation crumbled down Nietzsche’s intellect in the dark paths of this world. (2002, 88) This return from the “vicious circle” should in no way be taken as a form of artistic prudence. Rather it can be seen as a dribble of demonic inconsistency as Dionysus transforms himself into a Christ that is in turn de-theologized: “Who can forbid that? Every man is capable of his own theology, nothing can stop him.” (2002, 73-74) This is a turn towards an existential vision of the world, historically coinciding with a particular political defeat of the Left, to which the poet devoted all his life: after the defeat of the popular front I raised the question “why do we exist?” while others were asking “why we failed.” (2002, 57)5 But most of all it is a return to poetry that exceeds the existential question itself, going beyond the issue of faith. Poetry comes in as a question of return after a defeat that is confessed in full profanity. Though it accepts the necessity of the defeat, it does not affirm it. Though it negates it, the negation is not in the name of a promise to be delivered in the kingdom of heavens. Following a historical and existential defeat, poetry is born post mortem . It signals a return to Christ as “groundless religiousness in the surprise of the real as such” (2002, 72) which is at once a return to the refuge of childhood. It is not a question of endurance towards an eternal return. Rather it is a question on the possibility of an existential return. Returning in a world as someone who cannot enjoy any returns exactly because he is averse to guarantees. A return without returns. *** PHOTOCOPY OF HAPPINESS When I was young I used to pin down cicadas and step on ant nests. I used to stand there silent for hours. With threads I decapitated bees. Now I am a dead man breathing. (Karouzos, 1993, II, 336.) The return to the “paradise of childhood” (2002, 68) constitutes the devouring refuge of its own memory when defeat becomes the synonym of adulthood. The political struggles of a young communist in a country torn up by a civil war right after World War II fraught with incarcerations and exiles. Historically they resulted in the defeat of the communist movement in Greece and opened up a long turbulent road that would peak in the dictatorship of 1967. Existentially they led to a series of disillusionments: mental breakdown, divorce, abandonment of studies in law school. To the question “why do we exist” the answer was poetry. Still this exposé should not be read as a sweeping chronography of a man. For it actually happens to coincide with the historical fate of a nation that after its modern constitution never stopped dreaming of the glories of its past youth, in a present that was (and is) sweepingly disappointing. But isn’t this return to youth finally a way of compensating for a loss of youth that necessarily results in a losing adulthood? Will Greeks, the eternal children of Plato and Nietzsche, ever learn? How to return without dying, how to remember without wasting time? WE ARE IN THE OPEN MEANING Living the coldest mauve night right across Parthenon I went to take a piss on some foliage and I was enjoying the foliage as it was steaming. (Karouzos, 1993, II, 340) Beyond the historical tragedies of modern Greece and away from any personal disappointments, the relation that this land holds with language and history is mediated through the Greek light—whose omnipresence is the very condition of its transcendence. All historical contradictions from Dionysus to Christ took place under this light; all those disseminated dialects were spoken beneath its warmth. To paraphrase Lévinas,6 light is both the condition of the world and of our withdrawal from it—a withdrawal towards the invisibility of God, of the dead, of meta-physics, resulting from the temptation that all is still here, behind this light the visibility of which they once evaded: “birds, the allurement of God.” (1993, I, 17) Under that luminous sky, if Greeks can do anything at all, it is to envision a return that will never come. All they can do is write poetry—which is doing nothing; other than lending an ear to a disseminated language whispering a unity that cannot be promised, as an adulthood in defeat is ready to recognize. Trying “to trap the invisible in visibility” (1993, II, 483) they forget that they have grown up and one day they die—with the promise of return. Hence an additional meaning must be given to this return to childhood. It does not signal salvation but rather its promise. To the ears of an aged continent it means that the return to/of poetry is a losing game, a return without returns. “Europe, Europe… you are nothing more than the continuation of Barabbas.” (1993, I, 295) *** “Life is not there to verify theories.”7 The records show that Karouzos was finally given a second-class pension from the Greek government, at the time when he was being recognized by the literary press as one of Greece’s major contemporary poets. Being neither a bourgeois nor a nobelist, he proclaimed himself to be an anarcho-communist, unconditionally faithful to the utopia of a classless society. He also drank, heavily. “Capitalism made an animal out of man/ Marxism made an animal out of truth/ Shut up.” (1993, II, 369) Perhaps one of the most scandalous divides of our times has been the one between the living and the dead, the latent prohibition that the living should not be concerned with the dead based on the mere impossibility of the dead to be concerned with the living in the first place. What adds to this scandal is that this divide abuses anything that cannot return to us by subsuming it under the same futility. Hence death is no longer “loss” in the usual sense. It no more refers to the things we lost but to our “loss” (of time, money and well-being) as we insist to dwell on them. Death is a waste —of time. It is this waste that we find in the insouciance of Greek expenditure; the waste in dealing with a language that most of its historical part is no longer spoken (a dead language); the waste in translating a poet who is ex definitio untranslatable; the waste of his vision, his money, his life. The waste of dealing with anything that cannot return and that cannot bring in any returns . But it is also the waste of life that poetry itself presupposes, the waste of dealing with invisibility, with anything that is out of this world and thus invokes the fear of death that is in turn—and surprisingly— nowhere to be found. Instead of death, what is there, beyond the light, is the being without us (to recall the Lévinasian il y a ), the mumble of our own nothingness which constitutes the price to be paid for writing poetry under an evergreek light. To understand this to-and-fro, is to realize that poetry is something out of this world that nevertheless takes place in this world, by virtue of this world. But to ridiculously equate this to-and-fro with death as non-existence, is to exile poetry along with its own possibility from this same old world: I do not believe that poetry will ever disappear from this world. […] But I am also sure that it does not have many chances of playing, as you say, a redemptive role in our vertiginous technological future. Without being endangered as a creative need, it will be placed on the side of history. (2002, 32) It is mainly there that we would like to locate the meaning of Nikos Karouzos’s poetry today. If we are willing to include the Greek original it is because we consider that it will be both a waste of time for us to do so (since most of you cannot read Greek) and because it might induce you to the even larger waste of learning it. We would additionally be glad if this small introduction served as an equally wasteful, academically useless piece of reading, gesturing towards a taboo of investing in anything Greek—that is in anything dead among the living, in anything that will never come back and maybe was never here in the first place. This is the only way to reserve for ourselves the possibility of poetry and preserve the light of its promise. “To return: that is the miracle.” (1993, I, 17) Athens, Greece July 10, 2011 NOTES 1 “ Capitale (a Late Latin word based on caput “head”) emerged in the twelfth to thirteenth centuries in the sense of funds, stock of merchandise, sum of money or money carrying interest.[…] The word and the reality it stood for appear in the sermons of St. Bernardino of Siena (1380-1444) ‘… quamdam seminalem rationem lucrosi quam communiter capitale vocamus ’, ‘that prolific cause of wealth that we commonly call capital’” (Braudel, 1992, 232-233). 2 “A great man – a man whom nature has constructed and invented in the grand style – what is he? First : there is a long logic in all of his activity, hard to survey because of its length, and consequently misleading; he has the ability to extend his will across great stretches of his life and to despise and reject everything petty about him, including even the fairest, ‘divinest’ things in the world.” (Nietzsche, 1968, 505, §962) 3 Cf. Deleuze, 1986, 186-9. 4 “Return is the being of becoming, the unity of multiplicity, the necessity of chance: the being of difference as such or the eternal return.” (Deleuze, 189)5 In this 1982 interview Karouzos refers to the defeat of the communist movement in Greece after the civil war of 1946-1949 between the Governmental Army and the Democratic Army of Greece, the military division of the Greek communist party. Karouzos’s father was a member of the communist National Liberation front (EAM) members of which formed the mainl resistance movement (ELAS) in Greece during WWII. The poet was a member of the United Panhellenic Organization of Youth (EPON), which was a youth division of EAM. After the end of the war, ELAS was called to disarmament in view of the formation of a National Army. The members of EAM resigned from the government of national unity and a series of protests led to a 3 year civil war between ELAS and the Government Army. After the defeat of ELAS the Communist party was outlawed and many communists were exiled in deserted Greek islands. Karouzos, who took action in the Greek resistance and was active during the Greek civil war, was exiled in Icaria on 1947 and in Makronisos on 1953 where he was called two years earlier to do his military service. 6 “Existence in the world qua light, which makes desire possible, is then, in the midst of being, the possibility of detaching oneself from being. To enter into being is to link up with objects; it is in effect a bond that is already tainted with nullity. It is already to escape anonymity. In this world where everything seems to affirm our solidarity with the totality of existence, where we are caught up in the gears of a universal mechanism, our first feeling, our ineradicable illusion, is a feeling or illusion of freedom. To be in the world is this hesitation, this interval in existing, which we have seen in the analyses of fatigue and the present.” (Lévinas, 1988,43-4) 7from a TV interview. THE POETRY OF NIKOS KAROUZOS From Redwriter [ Ερυθρογρ?φος ], in Collected Works, Vol . II, Athens: Ikaros. 1993, 463-4. [Athens: Apopeira, 1990, 9-10.] JESUS ANTI-OEDIPUS* Why were we once saving till the fifth day the Paschal lamb? The scriptures say: with this victim’s meat we ought to cleanse all of our senses. To give life to the whitest wave miraculous odors in the extension of the chest. Ideals to death. For us to witness the illustrious dawns of Absinthe and for the soul to be a deeply carved ornament on the fore we named will. Then many deer running amidst the evergreen growth with watery hymns, then, the unintended angels descending with heights spiraling in their momentum offer themselves to the luminous Adventure. Whence the need for speech and our sufferings covered with flags like the glorified dead. An incorporeal finger pointing at the flamboyant and fragrant holocausts within the tired horizons and the exhausted breadths with joys of the mistletoe on fire and shivering all of the green-leaved love. Something would have chirped again had we not driven it away— maybe the ewe’s grass. Something would have called us to the eternal resurrection— maybe the grace of spring. But now our heart is fiercely blinded, withdrawn to the appearances of Hades. Silence and ice incessantly cover the Infant Spirit in thatched times. While the cherry trees are dreaming faintly glowing in absolute darkness there’s nothing the Babylonians can contemplate in labs with automatic colored lights. How to rejoice now in the fifth day of the lamb? We have forked the stars. We’ve gradually become supposedly sublime with plucked chimeras in our hands. Avenged relentlessly by science. *Though the poem appears in a 1990 collection, it was actually written in 1968. Hence the reader must be aware in not associating Karouzos’ Anti-Oedipus with the famous 1972 work of Deleuze and Guattari, given that the former precedes the latter. ΙΗΣΟΥΣ ΑΝΤΙ-ΟΙΔΙΠΟΥΣ Γιατ? κρατο?σαμε κ?ποτε ?ς την π?μπτη μ?ρα το πασχαλιν? πρ?βατο; Τα κε?μενα λ?νε: μ’ αυτο? του θ?ματος το κρ?ας ?πρεπε να καθαρ?σουμε ?λες τις αισθ?σεις. Για να δ?σουμε κ?μα στη ζω? λευκ?τατο θαυμ?σιες ευωδι?ς στην ?κταση του στ?θους. Ιδανικ? στο χ?ρο. Για να βλ?πουμε τα λαμπρ? χαρ?ματα του ?ψινθου και να ’ναι η ψυχ? στ?λισμα βαθυχ?ρακτο της πλ?ρης που την ε?παμε θ?ληση. Τ?τε πολλ?ς δορκ?δες τρ?χοντας αν?μεσα στην καταπρ?σινη φ?ση με τους υδ?τινους ?μνους, τ?τε, κατεβα?νοντας οι αθ?λητοι ?γγελοι με κυλινδο?μενο το ?ψος στην ορμ? τους χαρ?ζονται της αστραφτερ?ς Περιπ?τειας. ?θεν η μιλι? γι’ αυτ? χρει?ζεται και τα δειν? σκεπ?ζονται ωσ?ν τους τιμημ?νους νεκρο?ς με σημα?ες. Ασ?ματο δ?χτυλο δε?χνει τα φλογ?δη και μοσχοβ?λα ολοκαυτ?ματα στους κουρασμ?νους ορ?ζοντες στα εξουθενωμ?να πλ?τη καθ?ς αν?βουν οι χαρ?ς του νερα?δ?ξυλου και τρ?μει ολ?κληρη η πρασιν?φυλλη αγ?πη. Κ?τι θα κελαηδο?σε π?λι αν δεν το δι?χναμε— μπορε? της προβατ?νας το χορτ?ρι. Κ?τι θα μας καλο?σε στην απ?ραντη αν?σταση— μπορε? του ?αρος η χ?ρη. Μα η καρδι? μας ?γρια τυφλ?θηκε π?ρασε στα φαιν?μενα του ?δη. Σιγ? και π?γος αδι?κοπα σκεπ?ζει στους αχυρ?νιους καιρο?ς το Ν?πιο Πνε?μα. Την ?ρα που ονειρε?ονται οι βυσσινι?ς και λ?μπουν αμυδρ? μεσ’ στο απλ?τατο σκοτ?δι τ?ποτα δε στοχ?ζονται οι βαβυλ?νιοι στα εργαστ?ρια με τ’ αυτ?ματα χρωματιστ? φ?τα. Π?ς να χαρο?με πια την π?μπτη μ?ρα του προβ?του; Φουρκ?σαμε τ’ αστ?ρια. Γ?ναμε σιγ?-σιγ? δ?θεν υπ?ροχοι με μαδημ?νες χ?μαιρες στα χ?ρια. Μας ν?μεται σκληρ? η επιστ?μη. From: Redwriter [Ερυθρογρ?φος], in Collected Works, Vol. II, Athens: Ikaros. 1993, 472. [Athens: Apopeira, 1990, 18.] DIALECTΙCS OF SPRING Christ the straight angle; Christ the Pythagorean theorem. Christ the infinitesimal calculus from above the blessed Sets Christ. Christ the tessellation of massive particles Christ the zero mass. Hence we spray numbers and fields of lust. We are carabineers of diseased logic plus something— Observed means observer and Hekate The darkness luminous and light in the dark Astarte banqueters demons from today. ΔΙΑΛΕΚΤΙΚΗ ΤΟΥ ΕΑΡΟΣ Χριστ?ς η ορθ? γων?α· Χριστ?ς το πυθαγ?ριο θε?ρημα. Χριστ?ς ο απειροστικ?ς λογισμ?ς ?νωθεν ?λβια Χριστ?ς τα Σ?νολα. Χριστ?ς η ψηφιδογραφ?α στα μαζικ? σωμ?τια Χριστ?ς η μ?ζα μηδ?ν. ?ρα ψεκ?ζουμε αριθμο?ς και πεδ?α λαγνε?ας. Ε?μαστε τυφεκιοφ?ροι νοσο?σης λογικ?ς και κ?τι-- παρατηρο?μενο σημα?νει παρατηρητ?ς και Εκ?τη σκ?τος το π?μφωτο και φως εν τ? σκοτ?? η Αστ?ρτη συνδαιτημ?νες δα?μονες απ’ ?ρτι. From: Redwriter [Ερυθρογρ?φος], Athens: Apopeira, 1990, 18. [1993, II, 472]. CREDO (as we are used to say in Latin) Α I believe in one Poet expelled from heavens / fugitive from the god and vagabond, Empedocles / and here on earth / exile on the earth etc. of Baudelaire /. Β I believe in one Computer inside thunder and through matter. Γ Suffering undefiled / substantive / the Poet uplifts himself slow-burning suicidal implying lengthy sleeps. Δ Cutting down on prospective mistakes. Ε Of all things visible and invisible officiating the onion-peelings. Ζ The Poet has nothing / see the departed /. Η I believe in one Poet that says: madness I enjoy; he ridicules existence; let me light up from my mana. Θ Syntax he doesn’t care about when musicality commands him. Along with still more licenses, and Ts are played according to the concept sound anywhere. E.g. the winters here, he winters there; it will not come—I will not rest, etc. etc. Ι The Poet exercises thought until it’s stripped down. Κ And if he’s Greek he must always study the fineness of Attica, in light, mountains, fields and sea. For this fineness teaches language. Λ And if he’s deeply destined the Poet expresses the unexplainable of the explained; he happens to be a rightful heir to the scientist and his predecessor. Μ On the froth he does not last; the Poet blusters at the bottom of the pot. Ν Flamebred and never redeemed. Ξ The Poet must sometimes say: what a consumption of presence — be a bit lonely for a change! Ο The Poet is twilit. Π He is susceptible of deaths and resurrections. Ρ He looks from the corner of his eye and exists in a glance. Σ He follows behind the mother. Τ Eveningless when it comes to age. Υ I believe in one Poet who says: let the purities coincide. Until the Corinth of the Universe or even further. Φ In a higher despair. Χ In a brighter quintessence. Ψ In one sensation that lifts off. Ω Forgiving everyone. CREDO (ως ε?θισται να λ?με λατινιστ?) Α Πιστε?ω εις ?να Ποιητ?ν εκτ?ς ουρανο? / φυγ?ς θε?θεν και αλ?της, Εμπεδοκλ?ς / και επ? της γης / εξ?ριστος π?νω στη γη κ.λπ. του Βωδελα?ρου /. Β Πιστε?ω εις ?να Υπολογιστ?ν εντ?ς κεραυνο? και δια της ?λης. Γ Υποφ?ροντας ?χραντα / ουσιαστικ?ν / ο Ποιητ?ς ανατε?νεται βραδυφλεγ?ς αυτ?χειρας εξυπακο?οντας πολ?ωρους ?πνους. Δ Τα υποψ?φια λ?θη λιγοστε?οντας. Ε Ορατ?ν τε π?ντων και αορ?των ιερουργ?ντας την αποκρομμ?ωση. Ζ Ο Ποιτ?ς ?χει τ?ποτα / βλ?πε τους αναχωρ?σαντες /. Η Πιστε?ω εις ?να Ποιητ?ν που λ?ει: η τρ?λα μ’ αρ?σει· γελοιοποιε? την ?παρξη· ας αν?ψω απ’ τη μ?να μου. Θ Συνταχτικ? δεν το γνοι?ζεται στην προσταγ? της μουσικ?τητας. Μαζ? και μ’ ?λλες ακ?μη λευτερι?ς, και τα νυ πα?ζονται κατ? την ?ννοια ?χος οπουδ?ποτε. Π.χ. τον χειμ?να εδ?, το χειμ?να εκε?· δε θ? ’ρθει – δεν θα καταλαγι?σουμε, κ. λπ. κ.λπ. Ι Ο Ποιητ?ς γυμν?ζει τη σκ?ψη σε απογ?μνωση. Κ Κι αν ε?ναι ?λληνας οφε?λει να σπουδ?ζει π?ντοτε της Αττικ?ς τη λεπτ?τητα, σε φως, βουν?, χωρ?φια και θ?λασσα. Διδ?σκει γλ?σσα η λεπτ?τητα το?τη. Λ Κι αν ε?ναι βαθι? πεπρωμ?νος ο Ποιητ?ς εκφρ?ζει το ανεξ?γητο του εξηγητο?· τυγχ?νει ν?μιμος δι?δοχος του επιστ?μονα και προκ?τοχ?ς του. Μ Στον αφρ? δεν ?χει δι?ρκεια· στο πατοκ?ζανο μα?νεται ο Ποιητ?ς. Ν Φλογοδ?αιτος και ποτ? ξελυτρωμ?νος. Ξ Ο Ποιητ?ς κ?ποτε πρ?πει να λ?ει: μεγ?λη καταν?λωση παρουσ?ας – γενε?τε και λ?γο μοναξι?ρηδες! Ο Ο Ποιητ?ς ε?ναι αμφ?φλοξ. Π Επιδ?χεται θαν?τους και αναστ?σεις. Ρ Ακροθωρ?ζει και υπ?ρχει σε ξαφνοκο?ταγμα. Σ Ε?ναι ουραγ?ς της μητ?ρας. Τ Αν?σπερος απ? ηλικ?α. Υ Πιστε?ω εις ?να Ποιητ?ν που λ?ει: να συμπ?σουν οι αγν?τητες. Μ?χρι την Κ?ρινθο του Σ?μπαντος ? μακρ?τερα. Φ Σε αν?τερη απελπισ?α. Χ Σε φαειν?τερη πεμπτουσ?α. Ψ Σε μια α?σθηση που πτηνο?ται. Ω Συγχωρ?ντας τους π?ντες. From Large Sized Logic [ Λογικ? μεγ?λου σχ?ματος ], Athens: Erato, 1989, n.p. [1993, II, 521-3]. (shrink)