How should we understand validity? A standard way to characterize validity is in terms of the preservation of truth (or truth in a model). But there are several problems facing such characterizations. An alternative approach is to characterize validity epistemically, for instance in terms of the preservation of an epistemic status. In this paper, I raise a problem for such views. First, I argue that if the relevant epistemic status is factive, such as being in a position to know or (...) having conclusive evidence for, then the account runs into trouble if we endorse certain familiar logical principles. Second, I argue that if the relevant epistemic status is non-factive, such as is rationally committed to or has justification for believing, then a similar problem arises if we endorse the logical principles as well as a sufficiently strong epistemic “level-bridging” principle. Finally, I argue that an analogous problem arises for the most natural characterization of validity in terms of rational credence. (shrink)

In this article, we shall attempt to lay down the parameters within which the practice of the virtues may be enabled in the field of finance. We shall be drawing from the three main sources, Aristotle, Catholic Social Teaching and MacIntyre, on which virtue ethics is based. The research question is what ought to be done for financial activities to truly contribute to eudaimonia or human flourishing, to the achievement of three distinct kinds of goods as required of virtue, “those (...) internal to practices, those which are the goods of an individual life and those which are the goods of the community”, and to “[help] man on the path of salvation” in the midst of complex network of relationships in modern societies. These parameters could then be taken as conditions financiers ought to fulfill in order to live the virtues in their work and across different life spheres. (shrink)

We characterize Weihrauch reducibility in $ \operatorname {\mathrm {E-PA^{\omega }}} + \operatorname {\mathrm {QF-AC^{0,0}}}$ and all systems containing it by the provability in a linear variant of the same calculus using modifications of Gödel’s Dialectica interpretation that incorporate ideas from linear logic, nonstandard arithmetic, higher-order computability, and phase semantics.

A two-sorted term system characterizing NC implicitly is described. The term system is defined over the tree algebra [MATHEMATICAL DOUBLE-STRUCK CAPITAL T], the free algebra generated by 0, 1 and ∗, and the recursion scheme uses pointers over tier 0. This differs from previous characterizations of NC, where tier 1 pointers were used or full parameter substitution over tier 0 was allowed.

An adequate semantics for generic sentences must stake out positions across a range of contested territory in philosophy and linguistics. For this reason the study of generic sentences is a venue for investigating different frameworks for understanding human rationality as manifested in linguistic phenomena such as quantification, classification of individuals under kinds, defeasible reasoning, and intensionality. Despite the wide variety of semantic theories developed for generic sentences, to date these theories have been almost universally model-theoretic and representational. This essay outlines (...) a range of proof-theoretic analyses for characterizing generics. Particular attention is given to an expressivist proof-theory that can be traced to 1) work on logical syntax that Carnap undertook prior to his turn toward truth-conditional model theory in the late 1930s, and 2) research on sequent calculi and natural deduction systems that originate in work from Gentzen and Prawitz.1. (shrink)

We present a general construction of a □κ-sequence in Jensen's fine structural extender models. This construction yields a local definition of a canonical □κ-sequence as well as a characterization of those cardinals κ, for which the principle □κ fails. Such cardinals are called subcompact and can be described in terms of elementary embeddings. Our construction is carried out abstractly, making use only of a few fine structural properties of levels of the model, such as solidity and condensation.

The paper argues that a philosophically informative and mathematically precise characterization is possible by (i) describing a particular proposal for such a characterization, (ii) showing that certain criticisms of this proposal are incorrect, and (iii) discussing the general issue of what a characterization of logical constants aims at achieving.

A symmetric network consists of a set of positions and a set of bilateral links between these positions. For every symmetric network we define a cooperative transferable utility game that measures the “power” of each coalition of positions in the network. Applying the Shapley value to this game yields a network power measure, the β-measure, which reflects the power of the individual positions in the network. Applying this power distribution method iteratively yields a limit distribution, which turns out to be (...) proportional to the well-known degree measure. We compare the β-measure and degree measure by providing characterizations, which differ only in the normalization that is used. (shrink)

JiJi Zhang and Peter Spirtes. A Characterization of Markov Equivalence Classes for Ancestral Graphical Models.

The first section of this paper is concerned with the intrinsic properties of elementary monadic logic (EM), and characterizations in the spirit of Lindström [2] are given. His proofs do not apply to monadic logic since relations are used, and intrinsic properties of EM turn out to differ in certain ways from those of the elementary logic of relations (i.e., the predicate calculus), which we shall call EL. In the second section we investigate connections between higher-order monadic and polyadic logics.EM (...) is the subsystem of EL which results by the restriction to one-place predicate letters. We omit constants (for simplicity) but take EM to contain identity. Let atypebe any finite sequence (possibly empty) of one-place predicate letters. A modelMof typehas a nonempty universe ∣M∣ and assigns to each predicate letterPofa subsetPMof ∣M∣.Let us take a monadic logicLto be any collection of classes of models, calledL-classes, satisfying the following:1. All models in a givenL-class are of the same type (called the type of the class).2. Isomorphic models lie in the sameL-classes.3. IfandareL-classes of the same type, thenandareL-classes. (shrink)

We consider a real-valued function f defined on the set of infinite branches X of a countably branching pruned tree T. The function f is said to be a limsup function if there is a function $u \colon T \to \mathbb {R}$ such that $f(x) = \limsup _{t \to \infty } u(x_{0},\dots,x_{t})$ for each $x \in X$. We study a game characterization of limsup functions, as well as a novel game characterization of functions of Baire class 1.

The subject of this paper is a characterization of the $\Sigma_1$ -definable set functions of Kripke-Platek set theory with infinity and a uniform version of axiom of choice: $KP\omega+(uniform\;AC)$ . This class of functions is shown to coincide with the collection of set functionals of type 1 primitive recursive in a given choice functional and $x\mapsto\omega$ . This goal is achieved by a Gödel Dialectica-style functional interpretation of $KP\omega+(uniform\;AC)$ and a computability proof for the involved functionals.

We provide another characterization of the Owen value for TU games with a coalition structure without the additivity axiom.

This article presents a characterization of higher-order risk preferences such as prudence or temperance in terms of statistical moments. Our results, which are generalizations of Roger :27–44, 2011) and Ekern, 329–333, 1980), give a better understanding of how higher-order risk preferences relate to skewness preference and kurtosis aversion. While they are not based on expected utility theory, an implication within that theory is that all commonly used utility functions exhibit skewness preference and kurtosis aversion.

An important component in the interventionist account of causal explanation is an interpretation of counterfactual conditionals as statements about consequences of hypothetical interventions. The interpretation receives a formal treatment in the framework of functional causal models. In Judea Pearl’s influential formulation, functional causal models are assumed to satisfy a “unique-solution” property; this class of Pearlian causal models includes the ones called recursive. Joseph Halpern showed that every recursive causal model is Lewisian, in the sense that from the causal model one (...) can construct a possible worlds model in David Lewis’s well-known semantics that satisfies the exact same formulas in a certain language. Moreover, he demonstrated that some Pearlian (non-recursive) models are not Lewisian in this sense. This raises the question regarding the exact contour of Lewisian causal models. In this paper, we provide a characterization of the class of Lewisian causal models and a complete axiomatization with respect to this class. Our results have philosophically interesting consequences, two of which are especially worth noting. First, the class of Stalnakerian causal models, a subclass of Lewisian causal models, is precisely the class of Pearlian models that do not contain any cycle of counterfactual dependence (in a sense of counterfactual dependence akin to Lewis’s famous relation between distinct events). Second, a more natural class of causal models is actually a superclass of Lewisian causal models, the logic of which respects only weak centering rather than centering. (shrink)

We study computable PAC (CPAC) learning as introduced by Agarwal et al. (2020). First, we consider the main open question of finding characterizations of proper and improper CPAC learning. We give a characterization of a closely related notion of strong CPAC learning, and provide a negative answer to the COLT open problem posed by Agarwal et al. (2021) whether all decidably representable VC classes are improperly CPAC learnable. Second, we consider undecidability of (computable) PAC learnability. We give a simple (...) general argument to exhibit such ndecidability, and initiate a study of the arithmetical complexity of learnability. We briefly discuss the relation to the undecidability result of Ben-David et al. (2019), that motivated the work of Agarwal et al. (shrink)

This paper gives an implicit characterization of the class of functions computable in polynomial space by deterministic Turing machines – PSPACE. It gives an inductive characterization of PSPACE with no ad-hoc initial functions and with only one recursion scheme. The main novelty of this characterization is the use of pointers to reach PSPACE. The presence of the pointers in the recursion on notation scheme is the main difference between this characterization of PSPACE and the well-known Bellantoni-Cook (...) characterization of the polytime functions – PTIME. (shrink)

In this paper we discuss an interpretation of intuitionistic type theory in many-sorted arithmetic with so-called conditional application. Via the formulas-as-types correspondence the arithmetical system in turn can be embedded in ML, resulting in a characterization of strong Σ-elimination by an axiom of conditional choice.

In this paper we mainly deal with first-order languages without equality and introduce a weak form of equality predicate, the so-called Leibniz equality. This equality is characterized algebraically by means of a natural concept of congruence; in any structure, it turns out to be the maximum congruence of the structure. We show that first-order logic without equality has two distinct complete semantics (fll semantics and reduced semantics) related by the reduction operator. The last and main part of the paper contains (...) a series of Birkhoff-style theorems characterizing certain classes of structures defined without equality, not only full classes but also reduced ones. (shrink)

We present some characterizations of the members of Δta2, that class of the topological arithmetical hierarchy which is just large enough to include several fundamental types of sets of points in Euclidean spaces ℝk. The limit characterization serves as a basic tool in further investigations. The characterization by effective difference chains of effectively exhaustible sets yields only a hierarchy within a subfield of Δta2. Effective difference chains of transfinite (but constructive) order types, consisting of complements of effectively exhaustible (...) sets, as well as another closely related concept, yield a rich hierarchy within the whole class Δta2. The presentation always first reports analogies between Hausdorff's difference hierarchy within the Borel class ΔB2 and Ershov's hierarchy within the class Δ02 of the arithmetical hierarchy; after that the counterparts for Δta2 are developed. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

How should physical entities be characterized? Physicalists, who have most to do with the notion, usually characterize the physical by reference to two components: 1. The physical entities are the entities treated by fundamental physics with the proviso that 2. Physical entities are not fundamentally mental (that is, do not individually possess or bestow mentality) Here I explore the extent to which the appeals to fundamental physics and to the NFM (“no fundamental mentality”) constraint are appropriate for characterizing the physical, (...) especially for purposes of formulating physicalism. Ultimately, I motivate and defend a version of an account incorporating both components: The physics-based NFM account: An entity existing at a world w is physical iff (i) it is treated, approximately accurately, by current or future (in the limit of inquiry, ideal) versions of fundamental physics at w, and (ii) it is not fundamentally mental (that is, does not individually either possess or bestow mentality). (shrink)

The sole purpose of this paper is to give an algebraic characterization, in terms of a superamalgamation property, of a local version of Craig interpolation theorem that has been introduced and studied in earlier papers. We continue ongoing research in abstract algebraic logic and use the framework developed by Andréka– Németi and Sain.

Two different characterizations of POV measures with commutative range are compared using a representation of some stochastic operators by (weak) Markov kernels. A representation by Choquet theorem is obtained as an integral over functions of a sharp observable appearing in one of the characterizations. A Naimark extension is constructed.

We characterize the join-irreducible Medvedev degrees as the degrees of complements of Turing ideals, thereby solving a problem posed by Sorbi. We use this characterization to prove that there are Medvedev degrees above the second-least degree that do not bound any join-irreducible degrees above this second-least degree. This solves a problem posed by Sorbi and Terwijn. Finally, we prove that the filter generated by the degrees of closed sets is not prime. This solves a problem posed by Bianchini and (...) Sorbi. (shrink)

We give a syntactic characterization of (finitary) theories whose categories of models are closed under the formation of connected limits (respectively the formation of pullbacks and substructures) in the category of all structures. They are also those theories whose consistent extensions by new atomic facts admit in each component an initial structure (respectively an initial term structure), and also thoseT for whichM(T) is locally finitely multi-presentable in a canonical way. We also show that these two properties of theories are (...) nonuniform. (shrink)

We give syntactic characterizations of1. the theories whose categories of models are closed under the formation of pullbacks, and of2. the locally ω-polypresentable categories.A somewhat typical example is the category of algebraically closed fields. Case is proved by classical model-theoretic methods; it solves a problem raised by H. Volger . The solution of case is in the spirit of the ones for the locally ω-presentable and ω-multipresentable cases found by M. Coste and P.T. Johnstone respectively. The problem was raised in (...) the context of Domain Theory by F. Lamarche. (shrink)

We present some characterizations of the members of Δta2, that class of the topological arithmetical hierarchy which is just large enough to include several fundamental types of sets of points in Euclidean spaces ℝk. The limit characterization serves as a basic tool in further investigations. The characterization by effective difference chains of effectively exhaustible sets yields only a hierarchy within a subfield of Δta2. Effective difference chains of transfinite order types, consisting of complements of effectively exhaustible sets, as (...) well as another closely related concept, yield a rich hierarchy within the whole class Δta2. The presentation always first reports analogies between Hausdorff's difference hierarchy within the Borel class ΔB2 and Ershov's hierarchy within the class Δ02 of the arithmetical hierarchy; after that the counterparts for Δta2 are developed. (shrink)

We give some characterizations for both the untrapped set and the top cycle choice functions. We link these characterizations with the well-known characterization of the maximal elements choice function. Our characterizations strongly rely on the notion of “two-tier domination”.

It is proved that $\Pi^1_1$ -indescribability in $P_{\kappa}\lambda$ can be characterized by combinatorial properties without taking care of cofinality of $\lambda$ . We extend Carr's theorem proving that the hypothesis $\kappa$ is $2^{\lambda^{<\kappa}}$ -Shelah is rather stronger than $\kappa$ is $\lambda$ -supercompact.

The rise of a “maker movement,” located in hacker and makerspaces and involving the democratization of technologies of production and support of grassroots innovation, is receiving increasing attention from science and technology studies scholarship. This article explores how hacking is characterized by users of hacker and makerspaces and relates this to broader discussion of the maker movement as, for instance, promoting innovation, engaged in countercultural critique, or as accessible to anyone. Based on an interview study of users of twelve hacker (...) and makerspaces across the United States, it argues that for these users, hacking is not about politics, commercial innovation, or critique. Rather, it is understood as a lifestyle one subscribes to, a meaningful leisure activity, or as providing access to a welcoming and close-knit community. Contrary to expectations of the maker movement as heralding social change, the benefits of hacking were viewed as personal rather than political, economic, or social; similarly, democratization of technology was experienced as rather incidental to most hackers’ and makers’ experiences. (shrink)

We say a countable model ������ has a 0-basis if the types realized in ������ are uniformly computable. We say ������ has a (d-)decidable copy if there exists a model ������ ≅ ������ such that the elementary diagram of ������ is (d-)computable. Goncharov, Millar, and Peretyat'kin independently showed there exists a homogeneous model ������ with a 0-basis but no decidable copy. We extend this result here. Let d ≤ 0' be any low₂ degree. We show that there exists a homogeneous (...) model ������ with a 0-basis but no d-decidable copy. A degree d is 0-basis homogeneous bounding if any homogenous ������ with a 0-basis has a d-decidable copy. In previous work, we showed that the nonlow₂ $\Delta _{2}^{0}$ degrees are 0-basis homogeneous bounding. The result of this paper shows that this is an exact characterization of the 0-basis homogeneous bounding $\Delta _{2}^{0}$ degrees. (shrink)

A class of Kripke models is modally definable if there is a set of modal formulas such that the class consists exactly of models on which every formula from that set is globally true. In this paper, a class is also considered definable if there is a set of formulas such that it consists exactly of models in which every formula from that set is satisfiable. The notion of modal definability is then generalized by combining these two. For thus obtained (...) types of modal definability on the level of Kripke models, we give characterization theorems in the usual form, in terms of algebraic closure conditions. As some consequences of these, various preservation results are presented. Also, some characterizations are strengthened by replacing closure under ultraproducts with closure under ultrapowers. (shrink)

Experiences of racial discrimination can seem to be caused by one’s race, a combination of social identities, or non-social features. In other words, racial discrimination can be intersectional or attributionally ambiguous. This poses challenges for current understandings and measurement tools of racial discrimination in public health research, such as the explanation of racial health disparities. Different kinds of discriminatory experiences plausibly produce different psychological effects that mediate their negative health impacts. Thus, multiple characterizations and measurements of racial discrimination are needed. (...) As a result, I argue that racial discrimination should be a polysemous concept (with multiple meanings). (shrink)

In a voting context, when the preferences of voters are described by linear orderings over a finite set of alternatives, the Maximin rule orders the alternatives according to their minimal rank in the voters’ preferences. It is equivalent to the Fallback bargaining process described by Brams and Kilgour (Group Decision and Negotiation 10:287–316, 2001). This article proposes a characterization of the Maximin rule as a social welfare function (SWF) based upon five conditions: Neutrality, Duplication, Unanimity, Top Invariance, and Weak (...) Separability. In a similar way, we obtain a characterization for the Maximax SWF by using Bottom Invariance instead of Top Invariance. Then, these results are compared to the axiomatic characterizations of two famous scoring rules, the Plurality rule and the Antiplurality rule. (shrink)

We construct a model in which the strongly compact cardinals can be non-trivially characterized via the statement “κ is strongly compact iff κ is a measurable limit of strong cardinals”. If our ground model contains large enough cardinals, there will be supercompact cardinals in the universe containing this characterization of the strongly compact cardinals.

We aimed to characterize the age of onset of training, age at menarche, menstrual periodicity, and performance perception during the menstrual cycle and examined the impact of these reproductive variables on body composition, morphology, and body weight satisfaction in Brazilian elite futsal players. The study consisted of 115 female Brazilian elite futsal players from the top national teams. Data were collected during the twentieth Women’s Brazil Futsal Cup. Players were interviewed and self-reported their age of onset of training, age at (...) menarche, menstrual periodicity, and the menstrual period, where they performed best. We also asked for what they considered to be their ideal body weight as well as information related to their training. Subsequently, anthropometric measurements were performed to estimate the body composition and determine morphological characteristics. Fifty-nine players were postmenarche-trained and 52 were premenarche-trained. Eighteen, 65, and 28 were classified as early, normal, and late menarche, respectively. Only 11 and 1 had irregular menstrual cycles and were amenorrheic, respectively. Seventy-three, 23, and 9 reported that their game performance was the best at the follicular phase, menses, and luteal phase of the menstrual cycle, respectively. No associations between the four reproductive-related variables were found. Postmenarche-trained players had significant lower age at menarche and higher percentage body fat. The somatotype profile registered lower ectomorphy rate for the postmenarche-trained participants after controlling for covariates. Early menarche group presented higher sum of six skinfold thickness and endomorphy rate compared to normal and late menarche groups. No differences were found when menstrual periodicity groups and best performance groups were compared, except for higher femur width in the regular menstrual cycle group compared to the irregular one. The association between body weight satisfaction and the four reproductive-related variables were not observed. Premenarche-trained Brazilian elite futsal players had the menarche later than the postmenarche-trained athletes. Most of the participants had menarche age classified as “normal,” presented “regular” menstrual cycles and perceived to perform better during the follicular phase of the menstrual cycle. (shrink)

Fix a cardinal κ. We can ask the question: what kind of a logic L is needed to characterize all models of cardinality κ up to isomorphism by their L-theories? In other words: for which logics L it is true that if any models A and B of cardinality κ satisfy the same L-theory then they are isomorphic?It is always possible to characterize models of cardinality κ by their Lκ+,κ+-theories, but we are interested in finding a “small” logic L, i.e., (...) the sentences of L are hereditarily of smaller cardinality than κ. For any cardinal κ it is independent of ZFC whether any such small definable logic L exists. If it exists it can be second order logic for κ=ω and fourth order logic or certain infinitary second order logic Lκ,ω source for uncountable κ. All models of cardinality κ can always be characterized by their theories in a small logic with generalized quantifiers, but the logic may be not definable in the language of set theory. Our work continues and extends the work of Ajtai [Miklos Ajtai, Isomorphism and higher order equivalence, Ann. Math. Logic 16 181–203]. (shrink)

In this study we introduce two new properties, the Midpoint Outcome on a Linear Frontier (MOLF) and Balanced Focal Point (BFP) properties, to replace the Weak Pareto Optimality (WPO), Symmetry (SYM) and Independence of Equivalent Utility Representations (IEUR) properties in the axiomatic characterizations of the two most prominent solution concepts, namely the Nash and Kalai/Smorodinsky solutions, respectively.

We characterize the expressive power of extensions of Dependence Logic and Independence Logic by monotone generalized quanti ers in terms of quanti er extensions of existential second-order logic.

New and recent axioms for cooperative games with transferable utilities are introduced. The non-negative player axiom requires to assign a non-negative payoff to a player that belongs to coalitions with non-negative worth only. The axiom of addition invariance on bi-partitions requires that the payoff vector recommended by a value should not be affected by an identical change in worth of both a coalition and the complementary coalition. The nullified solidarity axiom requires that if a player who becomes null weakly loses (...) from such a change, then every other player should weakly lose too. We study the consequence of imposing some of these axioms in addition to some classical axioms. It turns out that the resulting values or set of values have all in common to split efficiently the worth achieved by the grand coalition according to an exogenously given weight vector. As a result, we also obtain new characterizations of the equal division value. (shrink)

Two-dimensional coupled map lattices display, in a specific parameter range, a stable phase (quasi-) periodic in both space and time. With small changes to the model parameters, this stable phase develops spontaneous eruptions of nonperiodic behavior. Although this behavior itself appears irregular, it can be characterized in a systematic fashion. In particular, parameter-independent features of the spontaneous eruptions may allow useful empirical characterizations of other phenomena that are intrinsically hard to predict and reproduce. Specific features of the distributions of lifetimes (...) and emergence rates of irregular states display such parameter-independent properties. Ó 2004 Elsevier Ltd. All rights reserved. (shrink)

We show that if N and M are transitive models of ZFA such that N M, N and M have the same kernel and same set of atoms, and M AC, then N is a Fraenkel-Mostowski-Specker (FMS) submodel of M if and only if M is a generic extension of N by some almost homogeneous notion of forcing. We also develop a slightly modified notion of FMS submodels to characterize the case where M is a generic extension of N not (...) necessarily by an almost homogeneous notion of forcing. (shrink)

The human masticatory system is a complex functional unit characterized by a multitude of skeletal components, muscles, soft tissues, and teeth. Muscle activation dynamics cannot be directly measured on live human subjects due to ethical, safety, and accessibility limitations. Therefore, estimation of muscle activations and their resultant forces is a longstanding and active area of research. Reinforcement learning (RL) is an adaptive learning strategy which is inspired by the behavioral psychology and enables an agent to learn the dynamics of an (...) unknown system via policy-driven explorations. The RL framework is a well-formulated closed-loop system where high capacity neural networks are trained with the feedback mechanism of rewards to learn relatively complex actuation patterns. In this work, we are building on a deep RL algorithm, known as the Soft Actor-Critic, to learn the inverse dynamics of a simulated masticatory system, i.e., learn the activation patterns that drive the jaw to its desired location. The outcome of the proposed training procedure is a parametric neural model which acts as the brain of the biomechanical system. We demonstrate the model’s ability to navigate the feasible three-dimensional (3D) envelope of motion with sub-millimeter accuracies. We also introduce a performance analysis platform consisting of a set of quantitative metrics to assess the functionalities of a given simulated masticatory system. This platform assesses the range of motion, metabolic efficiency, the agility of motion, the symmetry of activations, and the accuracy of reaching the desired target positions. We demonstrate how the model learns more metabolically efficient policies by integrating a force regularization term in the RL reward. We also demonstrate the inverse correlation between the metabolic efficiency of the models and their agility and range of motion. The presented masticatory model and the proposed RL training mechanism are valuable tools for the analysis of mastication and other biomechanical systems. We see this framework’s potential in facilitating the functional analyses aspects of surgical treatment planning and predicting the rehabilitation performance in post-operative subjects. (shrink)

IntroductionThe pelvic floor muscles are active during motor tasks that increase intra-abdominal pressure, but little is known about how the PFM respond to dynamic activities, such as gait. The purpose of this study was to characterize and compare PFM activity during walking and jogging in continent adults across the entire gait cycle.Methods17 able-bodied individuals with no history of incontinence participated in this study. We recorded electromyography from the abdominal muscles, gluteus maximus, and PFM while participants performed attempted maximum voluntary contractions (...) of all muscles and completed 60–70 strides in four gait conditions: slow walk ; regular walk ; transition walk ; jog. We quantified activity throughout the whole gait cycle and during periods of bursting for each participant, and analyzed the timing of PFM bursting periods to explore when the PFM were most active in the gait cycle. We also conducted a phase metric analysis on the PFM and GM burst timings. We performed a Spearman's rank-order correlation to examine the effect of speed on %aMVCGC, %aMVCBR, and phase metric score, and used the Wilcoxon Signed-Rank test to evaluate the effect of gait modality, matched for speed, on these variables.ResultsThe PFM were active throughout the gait cycle, with bursts typically occurring during single-leg support. The PFM and GM were in phase for 44–69% of the gait cycle, depending on condition. There was a positive correlation between gait speed and both %aMVCGC and %aMVCBR. Phase metric scores were significantly higher during jogging than transition walking, but there was no difference between gait modality on %aMVCGC or %aMVCBR. Where possible we disaggregated data by sex, although were unable to make statistical comparisons due to low sample sizes.ConclusionThe PFM are active during walking and jogging, with greater activity at faster speeds and with bursts in activity around single-leg support. The PFM and GM co-activate during gait, but are not completely in phase with each other. (shrink)

I present first results of my analysis of a collection of about 24,000 email messages from internal mailing lists of the ATLAS collaboration, at CERN, the particle physics laboratory, during the years 2010–2013. I represent the communication on these mailing lists as a network in which the members of the collaboration are connected if they reply to each other’s messages. Such a network allows me to characterize the collaboration from a bird’s eye view of its communication structure in epistemically relevant (...) terms. I propose to interpret established measures such as the density of the network as indicators for the degree of “collaborativeness” of the collaboration and the presence of “communities” as a sign of cognitive division of labor. Similar methods have been used in philosophical and historical studies of collective knowledge generation but mostly at the level of information exchange, cooperation and competition _between_ individual researchers or small groups. The present article aims to take initial steps towards a transfer of these methods and bring them to bear on the processes of collaboration _inside_ a “collective author.”. (shrink)

Porosity is considered as one of the most important indicators for the characterization of the comprehensive performance of thermal barrier coatings. In this study, the ultrasonic technique and the artificial neural network optimized with the genetic algorithm are combined to develop an intelligent method for automatic detection and accurate prediction of TBCs’s porosity. A series of physical models of plasma-sprayed ZrO2 coating are established with a thickness of 288 μm and porosity varying from 5.71% to 26.59%, and the ultrasonic (...) reflection coefficient amplitude spectrum is constructed based on the time-domain numerical simulation signal. The characteristic features f 1, f 2, A max, Δ A of the URCAS, which are highly dependent on porosity, are extracted as input data to train the GA_BPNN model for predicting the unknown porosity. The average error of the prediction results is 1.45%, which suggests that the proposed method can achieve accurate detection and quantitative characterization of the porosity of TBCs with complex pore morphology. (shrink)

$\eta $ -representations are a way of coding sets in computable linear orders that were first introduced by Fellner in his thesis. Limitwise monotonic functions have been used to characterize the sets with $\eta $ -representations, and give characterizations for several variations of $\eta $ -representations. The one exception is the class of sets with strong $\eta $ -representations, the only class where the order type of the representation is unique.We introduce the notion of a connected approximation of a set, (...) a variation on $\Sigma ^0_2$ approximations. We use connected approximations to give a characterization of the many-one degrees of sets with strong $\eta $ -representations as well new characterizations of the variations of $\eta $ -representations with known characterizations. (shrink)

We introduce crossed modules in cycloids, as a generalization of cycloids, which are algebraic logical structures arising in the context of the quantum Yang–Baxter equation. As a spacial case, we in particular focus on the crossed modules of $L-$algebras. These types of crossed modules are exceptional, since the category of $L-$algebras is not protomodular, nor Barr-exact, but it nevertheless has natural semidirect products that have not been described in category theoretic terms. We identify crossed ideals of crossed module in $L-$algebras, (...) and obtain some characteristics of these objects that are normally not encountered on crossed modules of groups or algebras. As a consequence, we characterize crossed self-similarity completely in terms of properties of $L-$algebras and the boundary map forming the crossed module. (shrink)

The idea of confining the idea of ‘rationality’ with that of the ‘choice of best elements’ unnecessarily limits the sense and scope of ‘rationality’. The existing internal consistency conditions that are popularly used in the social choice theory to assess a choice function are insufficient to analyse several choice patterns. The paper tries to address that problem by accepting a broader definition of rationality and characterizes choice behaviours where an individual chooses a k-th best element from set of alternatives, where (...) k is an integer. (shrink)

This is a complete exposition of a tight version of a fundamental theorem of computational complexity due to Levin: The inherent space complexity of any partial function is very accurately specifiable in a Π1 way, and every such specification that is even Σ2 does characterize the complexity of some partial function, even one that assumes only the values 0 and 1.