Results for ' characterization'

991 found
Order:
  1. Epistemic characterizations of validity and level-bridging principles.Joshua Schechter - 2024 - Philosophical Studies 181 (1):153-178.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  21
    Characterizing Virtues in Finance.Alejo José G. Sison, Ignacio Ferrero & Gregorio Guitián - 2019 - Journal of Business Ethics 155 (4):995-1007.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  3.  20
    The characterization of Weihrauch reducibility in systems containing.Patrick Uftring - 2021 - Journal of Symbolic Logic 86 (1):224-261.
    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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  9
    Characterizing NC with tier 0 pointers.Isabel Oitavem - 2004 - Mathematical Logic Quarterly 50 (1):9.
    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.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5. Characterizing generics are material inference tickets: a proof-theoretic analysis.Preston Stovall - 2019 - Inquiry: An Interdisciplinary Journal of Philosophy (5):668-704.
    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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  6.  26
    Characterization of □κin core models.Ernest Schimmerling & Martin Zeman - 2004 - Journal of Mathematical Logic 4 (01):1-72.
    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.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  7. A characterization of logical constants is possible.Gila Sher - 2003 - Theoria 18 (2):189-198.
    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.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  8. Characterizations of the β- and the Degree Network Power Measure.René Van Den Brink, Peter Borm, Ruud Hendrickx & Guillermo Owen - 2008 - Theory and Decision 64 (4):519-536.
    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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  9.  84
    A Characterization of Markov Equivalence Classes for Ancestral Graphical Models.Jiji Zhang & Peter Spirtes - unknown
    JiJi Zhang and Peter Spirtes. A Characterization of Markov Equivalence Classes for Ancestral Graphical Models.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  41
    The characterization of monadic logic.Leslie H. Tharp - 1973 - Journal of Symbolic Logic 38 (3):481-488.
    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 (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  11.  9
    Games Characterizing Limsup Functions and Baire Class 1 Functions.Márton Elekes, János Flesch, Viktor Kiss, Donát Nagy, Márk Poór & Arkadi Predtetchinski - 2022 - Journal of Symbolic Logic 87 (4):1459-1473.
    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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  28
    A characterization of the $\Sigma_1$ -definable functions of $KP\omega + $.Wolfgang Burr & Volker Hartung - 1998 - Archive for Mathematical Logic 37 (3):199-214.
    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.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  13.  53
    Another characterization of the Owen value without the additivity axiom.André Casajus - 2010 - Theory and Decision 69 (4):523-536.
    We provide another characterization of the Owen value for TU games with a coalition structure without the additivity axiom.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14. Moment characterization of higher-order risk preferences.Sebastian Ebert - 2013 - Theory and Decision 74 (2):267-284.
    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.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  34
    A Characterization of Lewisian Causal Models.Jiji Zhang - 2023 - In Natasha Alechina, Andreas Herzig & Fei Liang (eds.), Logic, Rationality, and Interaction: 9th International Workshop, LORI 2023, Jinan, China, October 26–29, 2023, Proceedings. Springer Nature Switzerland. pp. 94-108.
    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 (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16.  25
    On characterizations of learnability with computable learners.Tom F. Sterkenburg - 2022 - Proceedings of Machine Learning Research 178:3365-3379.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  17. Characterizing PSPACE with pointers.Isabel Oitavem - 2008 - Mathematical Logic Quarterly 54 (3):323-329.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  18.  44
    A characterization of ML in many-sorted arithmetic with conditional application.M. D. G. Swaen - 1992 - Journal of Symbolic Logic 57 (3):924 - 953.
    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.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  19.  7
    Characterization Classes Defined without Equality.R. Elgueta - 1997 - Studia Logica 58 (3):357-394.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   10 citations  
  20.  12
    Characterizations of the class Δ ta 2 over Euclidean spaces.Armin Hemmerling - 2004 - Mathematical Logic Quarterly 50 (4-5):507-519.
    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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  21. On characterizing the physical.Jessica Wilson - 2006 - Philosophical Studies 131 (1):61-99.
    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, (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   115 citations  
  22.  14
    Algebraic Characterization of the Local Craig Interpolation Property.Zalán Gyenis - 2018 - Bulletin of the Section of Logic 47 (1):45-58.
    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.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  45
    Characterizations of Commutative POV Measures.Anna Jenčová & Sylvia Pulmannová - 2009 - Foundations of Physics 39 (6):613-624.
    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.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  32
    Characterizing the Join-Irreducible Medvedev Degrees.Paul Shafer - 2011 - Notre Dame Journal of Formal Logic 52 (1):21-38.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  25.  13
    Syntactic characterization of closure under connected limits.Michel Hébert - 1991 - Archive for Mathematical Logic 31 (2):133-143.
    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 (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  16
    Syntactic characterizations of closure under pullbacks and of locally polypresentable categories.Michel Hébert - 1997 - Annals of Pure and Applied Logic 84 (1):73-95.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  27.  27
    Characterizations of the class ~2^t^a over Euclidean spaces.Armin Hemmerling - 2004 - Mathematical Logic Quarterly 50 (4):507.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  33
    Common characterizations of the untrapped set and the top cycle.Nicolas Houy - 2011 - Theory and Decision 70 (4):501-509.
    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”.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  29.  33
    Combinatorial characterization of $\Pi^11$ -indescribability in $P{\kappa}\lambda$.Yoshihiro Abe - 1998 - Archive for Mathematical Logic 37 (4):261-272.
    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.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  30.  9
    Characterizing Hacking: Mundane Engagement in US Hacker and Makerspaces.Sarah R. Davies - 2018 - Science, Technology, and Human Values 43 (2):171-197.
    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 (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  31.  11
    A characterization of the 0 -basis homogeneous bounding degrees.Karen Lange - 2010 - Journal of Symbolic Logic 75 (3):971-995.
    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 (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  32.  15
    Some characterization and preservation theorems in modal logic.Tin Perkov - 2012 - Annals of Pure and Applied Logic 163 (12):1928-1939.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33.  31
    Characterizing and Measuring Racial Discrimination in Public Health Research.Morgan Thompson - 2023 - Philosophy of Science 90 (3):721-743.
    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. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  82
    A characterization of the maximin rule in the context of voting.Ronan Congar & Vincent Merlin - 2012 - Theory and Decision 72 (1):131-147.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  35.  17
    Characterizing strong compactness via strongness.Arthur W. Apter - 2003 - Mathematical Logic Quarterly 49 (4):375.
    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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  36.  13
    Characterization of Reproductive and Morphological Variables in Female Elite Futsal Players.Marcos Roberto Queiroga, Danilo Fernandes da Silva, Sandra Aires Ferreira, Vinícius Müller Reis Weber, Daniel Zanardini Fernandes, Timothy Gustavo Cavazzotto, Bruno Sergio Portela, Marcus Peikriszwili Tartaruga, Matheus Amarante Nascimento & Edgar Ramos Vieira - 2021 - Frontiers in Psychology 12.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  44
    Characterizing all models in infinite cardinalities.Lauri Keskinen - 2013 - Annals of Pure and Applied Logic 164 (3):230-250.
    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., (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38.  52
    Simple Characterizations of the Nash and Kalai/smorodinsky Solutions.Nejat Anbarci - 1998 - Theory and Decision 45 (3):255-261.
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  39.  47
    Characterizing Quantifier Extensions of Dependence Logic.Fredrik Engström & Juha Kontinen - 2013 - Journal of Symbolic Logic 78 (1):307-316.
    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.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  40.  31
    Characterizations of weighted and equal division values.Sylvain Béal, André Casajus, Frank Huettner, Eric Rémila & Philippe Solal - 2016 - Theory and Decision 80 (4):649-667.
    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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  41. Characterizing spontaneous irregular behavior in coupled map lattices.Harald Atmanspacher - manuscript
    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 (...)
     
    Export citation  
     
    Bookmark  
  42. A Characterization of Permutation Models in Terms of Forcing.Eric J. Hall - 2002 - Notre Dame Journal of Formal Logic 43 (3):157-168.
    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 (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  14
    Characterizing Motor Control of Mastication With Soft Actor-Critic.Amir H. Abdi, Benedikt Sagl, Venkata P. Srungarapu, Ian Stavness, Eitan Prisman, Purang Abolmaesumi & Sidney Fels - 2020 - Frontiers in Human Neuroscience 14:523954.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  44.  11
    Characterizing Pelvic Floor Muscle Activity During Walking and Jogging in Continent Adults: A Cross-Sectional Study.Alison M. M. Williams, Maya Sato-Klemm, Emily G. Deegan, Gevorg Eginyan & Tania Lam - 2022 - Frontiers in Human Neuroscience 16.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45.  3
    Characterizing a collaboration by its communication structure.Adrian Wüthrich - 2023 - Synthese 202 (5):1-36.
    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 (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  46.  8
    Porosity Characterization of Thermal Barrier Coatings by Ultrasound with Genetic Algorithm Backpropagation Neural Network.Shuxiao Zhang, Gaolong Lv, Shifeng Guo, Yanhui Zhang & Wei Feng - 2021 - Complexity 2021:1-9.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47.  6
    A Characterization of the Strongly -Representable Many-One Degrees.Josiah Jacobsen-Grocott - 2022 - Journal of Symbolic Logic 87 (4):1631-1642.
    $\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, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  48.  4
    A characterization of crossed self-similarity on crossed modules in L-algebras.Selim Çetin & Utku Gürdal - forthcoming - Logic Journal of the IGPL.
    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, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  6
    Characterization of a k-th best element rationalizable choice function with full domain.Taposik Banerjee - forthcoming - Theory and Decision:1-14.
    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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50.  13
    Characterization of realizable space complexities.Joel I. Seiferas & Albert R. Meyer - 1995 - Annals of Pure and Applied Logic 73 (2):171-190.
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 991