The inherent tensile strength of iron

The cohesive energy of Fe as a function of structure, strain and magnetic state has been computed using the full potential linearized augmented-plane-wave method within the framework of density functional theory and the generalized gradient approximation. Calculations corresponding to uniaxial stress in the <100> direction reveal that the ideal tensile strength of bcc Fe is about 14.2GPa and is determined by instability with respect to transformation into an unstable ferromagnetic fcc structure. The low-energy fcc phase is a modulatedantiferromagnetic fcc structure that is connected to the bcc phase via a first-order magnetic transformation and does not compromise its ideal strength.     

Two-Valued Logics of Intentionality: Temporality,Truth, Modality,and Identity

The essay introduces a non-Diodorean, non-Kantian temporal modal semantics based on part-whole, rather than class, theory. Formalizing Edmund Husserl’s theory of inner time consciousness, §3 uses his protention and retention concepts to define a relation of self-awareness on intentional events. §4 introduces a syntax and two-valued semantics for modal first-order predicate object-languages, defines semantic assignments for variables and predicates, and truth for formulae in terms of the axiomatic version of Edmund Husserl’s dependence ontology (viz. the Calculus [CU] of Urelements) introduced by The Ontology of Intentionality I & II. It then uses the §3 results to define the modalities of truth, and §5 extends the semantics to identity claims. §6 defines and contrasts synthetic a priori truths to analytic a priori truths, and §7 compares Brentano School noetic semantic and Leibnizian possible-world semantic perspectives on modality. The essay argues that the modal logics it defines semantically are two-valued, first-order versions of the type of language which Husserl viewed as the language of any ontology of experience (i.e. of any science), and conceived as the logic of intentionality.     

A note on the proof theory the λII-calculus

The II-calculus, a theory of first-order dependent function types in Curry-Howard-de Bruijn correspondence with a fragment of minimal first-order logic, is defined as a system of (linearized) natural deduction. In this paper, we present a Gentzen-style sequent calculus for the II-calculus and prove the cut-elimination theorem.The cut-elimination result builds upon the existence of normal forms for the natural deduction system and can be considered to be analogous to a proof provided by Prawitz for first-order logic. The type-theoretic setting considered here elegantly illustrates the distinction between the processes of normalization in a natural deduction system and cut-elimination in a Gentzen-style sequent calculus.We consider an application of the cut-free calculus, via the subformula property, to proof-search in the II-calculus. For this application, the normalization result for the natural deduction calculus alone is inadequate, a (cut-free) calculus with the subformula property being required.This paper was written whilst the author was affiliated to the University of Edinburgh, Scotland, U.K. and revised for publication whilst he was affiliated to the University of Birmingham, England, U.K.Presented byDaniele Mundici     

Frege's Begriffsschrift is Indeed First-Order Complete

It is widely taken that the first-order part of Frege's Begriffsschrift is complete. However, there does not seem to have been a formal verification of this received claim. The general concern is that Frege's system is one axiom short in the first-order predicate calculus comparing to, by now, standard first-order theory. Yet Frege has one extra inference rule in his system. Then the question is whether Frege's first-order calculus is still deductively sufficient as far as the first-order completeness is concerned. In this short note we confirm that the missing axiom is derivable from his stated axioms and inference rules, and hence the logic system in the Begriffsschrift is indeed first-order complete.     

The seven virtues of simple type theory

Simple type theory, also known as higher-order logic, is a natural extension of first-order logic which is simple, elegant, highly expressive, and practical. This paper surveys the virtues of simple type theory and attempts to show that simple type theory is an attractive alternative to first-order logic for practical-minded scientists, engineers, and mathematicians. It recommends that simple type theory be incorporated into introductory logic courses offered by mathematics departments and into the undergraduate curricula for computer science and software engineering students.     

模态逻辑的集合论语义与互模拟不变性

含有命题变元的非良基集合能够被看作解释模态语言的模型。任给非良基集合a,一个命题变元p在a上真当且仅当p属于a。命题联结词的解释与古典命题逻辑相同。一个公式3A在a上真当且仅当存在集合b属于a,使得A在b上是真的。在一个集合中,属于关系被看作可及关系。在这种思想下,我们可以定义从模态语言到一阶集合论语言的标准翻译。对任意模态公式A和集合变元x,可以递归定义一阶集合论语言的公式ST(A,x)。在关系语义学下,van Benthem刻画定理是说,在带有唯一的二元关系符号R的一阶语言中,任何一阶公式等价于某个模态公式的标准翻译当且仅当这个一阶公式在互模拟下保持不变。因此,模态语言是该一阶关系语言的互模拟不变片段。同样,我们可以在集合上定义互模拟关系,证明van Benthem刻画定理对于集合论语义和集合上的互模拟不变片段成立,即模态语言是一阶集合论语言的集合互模拟不变片段。     

Athletes' experiences of expressive writing about sports stressors

ObjectivesThis study explored athletes' experiences of expressive writing about competitive sport stressors using standard expressive writing and reversal theory framed writing (Apter, 2001).DesignThe study employed a qualitative approach including narrative analysis of expressive writing and semi-structured interviews with athletes.MethodSixteen athletes were randomly allocated to a standard expressive writing or a reversal theory framed writing group. Both groups completed expressive writing about a stressor using standardised instructions. The reversal theory writing group were instructed on reversal theory states and imagery use to recreate them which they employed to write from different state perspectives in four subsequent sessions. Standard writing group participants completed four sessions following usual expressive writing instructions. Both groups completed a final session following these instructions and were interviewed about expressive writing and their perceptions of the stressor.ResultsKey outcomes were: re-evaluation and perspective changes, self development, stressor confrontation, problem solving, emotion management and, future uses of expressive writing.ConclusionsExpressive writing may be a technique that is useful for some athletes and recommendations for its application are made.     

Combinator Logics

Combinator logics are a broad family of substructual logics that are formed by extending the basic relevant logic B with axioms that correspond closely to the reduction rules of proper combinators in combinatory logic. In the Routley-Meyer relational semantics for relevant logic each such combinator logic is characterized by the class of frames that meet a first-order condition that also directly corresponds to the same combinator's reduction rule. A second family of logics is also introduced that extends B with the addition of propositional constants that correspond to combinators. These are characterized by relational frames that meet first-order conditions that reflect the structures of the combinators themselves.     

Toward a three-dimensional conceptualization of performance anxiety: Rationale and initial measurement development

ObjectivesAn integrated three-dimensional model of performance anxiety was constructed to offer an alternative conceptualization that may contribute to understanding of the complex anxiety–performance relationship. In particular, the adaptive potential (producing positive effects) of anxiety was acknowledged explicitly by including a regulatory dimension. This model is characterized by five subcomponents, with worry and self-focused attention representing cognitive anxiety, autonomous hyperactivity and somatic tension representing physiological anxiety, and perceived control representing the regulatory dimension of anxiety. The overview of the conceptual framework and the underlying rationale are presented.DesignAs a necessary first step towards model testing, an initial measure was developed and the factorial validity of the model was investigated.MethodConfirmatory factor analysis was used in two independent samples (N = 286, 327) in a wide context of sports performance.ResultsA 25-item measure of performance anxiety was established. Findings of CFA revealed support for a three-dimensional first-order model.ConclusionsAlthough the present model of performance anxiety was best presented as a three-dimensional first-order structure, the integrity of the conceptual framework is considered intact as such a factor structure distinctly reflects the three major processes (i.e., cognitive, physiological and regulatory) that are proposed to be activated in the anxiety dynamics from a broad cognitive perspective.     

Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames

The main result is that is no effective algorithmic answer to the question:how to recognize whether arbitrary modal formula has a first-order equivalent on the class of finite frames. Besides, two known problems are solved: it is proved algorithmic undecidability of finite frame consequence between modal formulas; the difference between global and local variants of first-order definability of modal formulas on the class of transitive frames is shown.Presented byHiroakira Ono     

Virtual Modality

Model-theoretic 1-types overa given first-order theory T may be construed as natural metalogical miniatures of G. W. Leibniz' ``complete individual notions', ``substances' or ``substantial forms'. This analogy prompts this essay's modal semantics for an essentiallyundecidable first-order theory T, in which one quantifies over such ``substances' in a boolean universe V(C), where C is the completion of the Lindenbaum-algebra of T.More precisely, one can define recursively a set-theoretic translate of formulae _N of formulae of a normal modal theory T_m based on T, such that the counterpart `<sub>i</sub>' of a the modal variable `x_i' of L(T_m) in this translation-scheme ranges over elements of V(C) that are 1-types of T with value 1 (sometimes called `definite' C-valued 1-types of T).The article's basic completeness-result (2.13) then establishes that varphi; is a theorem of T<sub>m</sub> iff [[ <sub>N</sub> () is aconsequenceof <sub>N</sub> (T<sub>m</sub>) for each extension N of T which is a subtheory of the canonical generic theory (ultrafilter) u]] = 1 – or equivalently, that T<sub>m</sub> is consistent iff[[there is anextension N of T such that N is a subtheory of the canonical generic theory u, and <sub>N</sub>() for all in T<sub>m</sub>]] > 0.The proof of thiscompleteness-result also shows that an N which provides a countermodel for a modally unprovable – or equivalently, a closed set in the Stone space St(T) in the sense of V(C) – is intertranslatable with an `accessibility'-relation of a closely related Kripke-semantics whose `worlds' are generic extensions of an initial universe V via C.This interrelation providesa fairly precise rationale for the semantics' recourse to C-valued structures, and exhibits a sense in which the boolean-valued context is sharp.     

Positive-Negative Asymmetry in the Evaluation of Trivial Stimuli

Abstract

The theory of the master status predicts that people who are seen as deviant in one respect come to be seen as deviant in other respects. American undergraduates filled out a questionnaire on which they were asked to attribute characteristics to two deviant (atheist and homosexual) and two nondeviant (Catholic and Republican) groups. It was found that the former groups were seen as lower class, extremely liberal, having had more permissive parents, more in need of counseling, using drugs more, less satisfied with various aspects of their lives, and as having less control over their lives. Furthermore, the respondents' own attitudes toward the deviant group or membership in the nondeviant group did not have an impact on how the groups were ranked in most instances. The results, then, provided strong support for the master status theory.     

Fibred Security Language

We study access control policies based on the says operator by introducing a logical framework called Fibred Security Language (FSL) which is able to deal with features like joint responsibility between sets of principals and to identify them by means of first-order formulas. FSL is based on a multimodal logic methodology. We first discuss the main contributions from the expressiveness point of view, we give semantics for the language both for classical and intuitionistic fragment), we then prove that in order to express well-known properties like ‘speaks-for’ or ‘hand-off’, defined in terms of says, we do not need second-order logic (unlike previous approaches) but a decidable fragment of first-order logic suffices. We propose a model-driven study of the says axiomatization by constraining the Kripke models in order to respect desirable security properties, we study how existing access control logics can be translated into FSL and we give completeness for the logic.     

Interpolation in Extensions of First-Order Logic

We prove a generalization of Maehara’s lemma to show that the extensions of classical and intuitionistic first-order logic with a special type of geometric axioms, called singular geometric axioms, have Craig’s interpolation property. As a corollary, we obtain a direct proof of interpolation for (classical and intuitionistic) first-order logic with identity, as well as interpolation for several mathematical theories, including the theory of equivalence relations, (strict) partial and linear orders, and various intuitionistic order theories such as apartness and positive partial and linear orders.

     

Steps Toward a Computational Metaphysics

In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in prover9 (a first-order automated reasoning system which is the successor to otter). After reviewing the second-order, axiomatic theory of abstract objects, we show (1) how to represent a fragment of that theory in prover9’s first-order syntax, and (2) how prover9 then finds proofs of interesting theorems of metaphysics, such as that every possible world is maximal. We conclude the paper by discussing some issues for further research.     

Line-based affine reasoning in Euclidean plane

We consider the binary relations of parallelism and convergence between lines in a 2-dimensional affine space. Associating with parallelism and convergence the binary predicates P and C and the modal connectives [P] and [C], we consider a first-order theory based on these predicates and a modal logic based on these modal connectives. We investigate the axiomatization/completeness and the decidability/complexity of this first-order theory and this modal logic.     

Some Characteristics of Dreams in Group - Analytic Psychotherapy

Abstract

Group psychoanalytic theory rests on many of the same psychoanalytic assumptions as individual psychoanalytic theory but has been slow in developing its own language and unique understanding of conflict within the group, as many group phenomena are not the same as individual psychic events. Regressive fantasies and alliances within and to the group are determined by group composition and the interaction of fantasies among members and leader. Bion’s useful but incomplete early abstract formulation of psychic regression in groups was the initial attempt to move beyond Freud’s largely sociological view. This paper explores some of the origins of Bion’s neglect of murderous violence in groups as a result of his own experiences in the first European war. In the following, I present evidence for the existence of a violent basic assumption and offer evidence as to Bion’s avoidance of murderous and violent acts.     

First-order indefinite and uniform neighbourhood semantics

The main purpose of this paper is to define and study a particular variety of Montague-Scott neighborhood semantics for modal propositional logic. We call this variety the first-order neighborhood semantics because it consists of the neighborhood frames whose neighborhood operations are, in a certain sense, first-order definable. The paper consists of two parts. In Part I we begin by presenting a family of modal systems. We recall the Montague-Scott semantics and apply it to some of our systems that have hitherto be uncharacterized. Then, we define the notion of a first-order indefinite semantics, along with the more specific notion of a first-order uniform semantics, the latter containing as special cases the possible world semantics of Kripke. In Part II we prove consistency and completeness for a broad range of the systems considered, with respect to the first-order indefinite semantics, and for a selected list of systems, with respect to the first-order uniform semantics. The completeness proofs are algebraic in character and make essential use of the finite model property. A by-product of our investigations is a result relating provability in S-systems and provability in T-systems, which generalizes a known theorem relating provability in the systems S 2° and C 2.The author would like to thank Prof. Nuel D. Belnap of the University of Pittsburg for many indispensable contributions to earlier versions of this work. The author also thanks the referee for several helpful comments and corrections.