The scattering number and isolated scattering number of a graph have been introduced in relation to Hamiltonian properties and network vulnerability, and the isolated scattering number plays an important role in characterizing graphs with a fractional 1-factor. Here we investigate the computational complexity of one variant, namely, the weighted isolated scattering number. We give a polynomial time algorithm to compute this parameter of interval graphs, an important subclass of perfect graphs.

Let ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsemigroups of ΩΩ, then we write U≈V if there exists a finite subset F of ΩΩ such that the subsemigroup generated by U and F equals that generated by V and F. The relative rank of U in ΩΩ is the least cardinality of a subset A of ΩΩ such that the union of U and A generates ΩΩ. In this paper (...) we study the notions of relative rank and the equivalence ≈ for semigroups of endomorphisms of binary relations on Ω.The semigroups of endomorphisms of preorders, bipartite graphs, and tolerances on Ω are shown to lie in two equivalence classes under ≈. Moreover such semigroups have relative rank 0, 1, 2, or in ΩΩ where is the minimum cardinality of a dominating family for . We give examples of preorders, bipartite graphs, and tolerances on Ω where the relative ranks of their endomorphism semigroups in ΩΩ are 0, 1, 2, and .We show that the endomorphism semigroups of graphs, in general, fall into at least four classes under ≈ and that there exist graphs where the relative rank of the endomorphism semigroup is 20. (shrink)

Traditional spatial enabled grammars lack flexibility in specifying the spatial semantics of graphs. This paper describes a new graph grammar formalism called the multigranularity Coordinate Graph Grammar (mgCGG) for spatial graphs. Based on the Coordinate Graph Grammar (CGG), the mgCGG divides coordinates into two categories, physical coordinates and grammatical coordinates, where physical coordinates are the common coordinates in the real world, and grammatical coordinates describe the restrictions on the spatial semantics. In the derivation and reduction of the mgCGG, (...) the spatial matching conditions between nodes are evaluated on the basis of the grammatical coordinates, which can be obtained by the specified granularities. By adjusting the granularities, both qualitative and quantitative analyses for spatial semantics can be obtained, including the transition states between them. In addition, a new redex searching algorithm with polynomial time complexity is designed for the mgCGG. A running example of drawing a flowchart is given to illustrate a practical application of the mgCGG. Through a detailed comparison with related spatial-enabled grammars, it is found that the mgCGG has good performance in four critical aspects—the semantics processing mechanism, fault-tolerance, redex searching algorithm, and practical application—providing a flexible yet uniform way to specify spatial graphs and building a bridge between nonspatial and spatial grammars. (shrink)

This paper presents a method to compute a posteriori probability intervals when the initial conditional information is also given with probability intervals. The right way to make an exact computation is with the associated convex set of probabilities. Probability trees are used to represent these initial conditional convex sets because they greatly save the space required. This paper proposes a simulated annealing algorithm, which uses probability trees to represent the convex sets in order to compute the a posteriori intervals.

Various methods have been employed to investigate different aspects of the brain activity modulation related to the performance of a cycling task. In our study we examined how functional connectivity and brain network efficiency varied during an endurance cycling task. To this purpose, we reconstructed EEG signals at source level: we computed current densities in 28 anatomical regions of interest (ROIs) through the eLORETA algorithm, then we calculated the Lagged Coherence of the 28 current density signals to define the adjacency (...) matrix. To quantify changes of functional network efficiency during an exhaustive cycling task, we computed three graph theoretical indices: local efficiency (LE), global efficiency (GE) and Density (D) in two different frequency bands, Alpha and Beta bands, that indicate alertness processes and motor binding/fatigue respectively. This analysis was conducted for six different task intervals: pre-cycling, initial, intermediate and final stages of cycling, active recovery and passive recovery. Fourteen participants performed an incremental cycling task with simultaneous EEG recording and RPE monitoring to detect participants’ exhaustion. LE remained constant during the endurance cycling task in both bands. Therefore, we speculate that fatigue processes did not affect segregated neural processing. We observed an increase of GE in the Alpha band only during cycling, that could be due to greater alertness processes and preparedness to stimuli during exercise. Conversely, although D did not change significantly over time in the Alpha band, its general reduction in the Beta bands during cycling could be interpreted within the framework of the neural efficiency hypothesis, which posits a reduced neural activity for expert/automated performances. We argue that the use of graph theoretical indices represents a clear methodological advancement in studying endurance performance. (shrink)

This work focuses on a multiagent system with time-varying interval uncertainty in the system matrix, where multiple agents interact through an undirected topology graph and only the bounding matrices on the uncertainty in the system matrix are known. A reduced-order interval observer, which is named the reduced-order neighborhood interval observer, is designed to estimate the relative state of each agent and those of its neighbors. It is shown that the reduced-order IO can guarantee the consensus of the (...) uncertain multiagent system. Finally, simulation examples are proposed to verify the theoretical findings. (shrink)

This paper focuses on the problem of load frequency control and sensor fault-tolerant control in the multiarea power grid. To solve these problems, a sliding mode control strategy based on an interval observer is designed. First, an interval observer is designed to obtain the boundary estimation information of the system state online, which is used to reconstruct the load disturbance online. Based on the reconstructed values, an integral sliding mode controller is designed to keep the system frequency stable (...) when the load is disturbed. Then, sensor fault is diagnosed by interval residual. An augmented observer is designed to estimate sensor fault online by equivalent transformation, and the sensor fault is compensated by the fault estimation to reduce the influence of fault on system performance and ensure the reliable and stable operation of the power system. The simulation results show the superiority of the proposed control strategy. (shrink)

This study aimed to analyze the mediating effect of tolerance of uncertainty and trait anxiety on future self-continuity and intention to use Internet wealth management systems. A questionnaire survey was distributed online and a total of 388 participants completed questionnaire, The questionnaire included the following scales: Chinese version of the FSC, Intention to Use the Internet Wealth Management, TU, and TA. Pearson correlation was used to investigate the correlation coefficient between variables while the sequential regression method was used to (...) analyze relationship between variables. To analyze the collected data, the SPSS 26.0 was used. A two-step procedure was applied to analyze the mediation effect. Confirmatory factor analysis was conducted to test the measurement model. Afterward, the Maximum Likelihood method was used for path analysis, and the Bias-corrected Bootstrap method was used to investigate determine the estimated value and confidence interval of the mediating effect. To analyze the mediation effect, the Mplus 7.0 was used. The results showed that FSC positively predicted individuals’ Internet wealth management systems. Furthermore, TU and TA played complete serial multiple mediating roles between FSC and IUIWM. The role of TA and TU have negative impact on intention to use. This study provides a theoretical basis in personality psychology that Internet financial product suppliers can use to improve the attractiveness of their products. Product managers can subdivide users according to these personality traits to provide customized products. (shrink)

In the thesis some combinatorial statements are analysed from the reverse mathematics point of view. Reverse mathematics is a research program, which dates back to the Seventies, interested in finding the exact strength, measured in terms of set-existence axioms, of theorems from ordinary non set-theoretic mathematics. After a brief introduction to the subject, an on-line (incremental) algorithm to transitively reorient infinite pseudo-transitive oriented graphs is defined. This implies that a theorem of Ghouila-Houri is provable in RCA_0 and hence is (...) computably true. Interval graphs and interval orders are the common theme of the second part of the thesis. A chapter is devoted to analyse the relative strength of different characterisations of countable interval graphs and to study the interplay between countable interval graphs and countable interval orders. In this context the theme of unique orderability of interval graphs arises, which is studied in the following chapter. The last chapter about interval orders inspects the strength of some statements involving the dimension of countable interval orders. The third part is devoted to the analysis of two theorems proved by Rival and Sands in 1980. The first principle states that each infinite graph contains an infinite subgraph such that each vertex of the graph is adjacent either to none, or to one or to infinitely many vertices of the subgraph. This statement, restricted to countable graphs, is proved to be equivalent to ACA_0 and hence to be stronger than Ramsey's theorem for pairs, despite the similarity of partial order with finite width contains an infinite chain such that each point of the poset is comparable either to none or to infinitely many points of the chain. For each k less than or equal to 3, the latter principle restricted to countable poset of width k is proved to be equivalent to ADS. Some complementary results are presented in the thesis. (shrink)

A fuzzy predictive fault-tolerant control scheme is proposed for a wide class of discrete-time nonlinear systems with uncertainties, interval time-varying delays, and partial actuator failures as well as unknown disturbances, in which the main opinions focus on the relevant theory of FPFTC based on Takagi-Sugeno fuzzy model description of these systems. The T-S fuzzy model represents the discrete-time nonlinear system in the form of the discrete uncertain time-varying delay state space, which is firstly constructed by a set of local (...) linear models and the nonlinear membership functions. The novel improved state space model can be further obtained by extending the output tracking error to the constructed model. Then the fuzzy predictive fault-tolerant control law based on this extended model is designed, which can increase more control degrees of freedom. Utilizing Lyapunov-Krasovskill theory, less conservative delay-range-dependent stable conditions in terms of linear matrix inequality constraints are given to ensure the asymptotically robust stability of closed-loop system. Meanwhile, the optimized cost function and H-infinity performance index are introduced to the stable conditions to guarantee the robust performance and antidisturbance capability. The simulation results on the temperature control of a strong nonlinear continuous stirred tank reactor show that the proposed control scheme is feasible and effective. (shrink)

This paper deals with higher-order vagueness in Williamson's 'logic of clarity'. Its aim is to prove that for 'fixed margin models' (W,d,α ,[ ]) the notion of higher-order vagueness collapses to second-order vagueness. First, it is shown that fixed margin models can be reformulated in terms of similarity structures (W,~). The relation ~ is assumed to be reflexive and symmetric, but not necessarily transitive. Then, it is shown that the structures (W,~) come along with naturally defined maps h and s (...) that define a Galois connection on the power set PW of W. These maps can be used to define two distinct boundary operators bd and BD on W. The main theorem of the paper states that higher-order vagueness with respect to bd collapses to second-order vagueness. This does not hold for BD, the iterations of which behave in quite an erratic way. In contrast, the operator bd defines a variety of tolerance principles that do not fall prey to the sorites paradox and, moreover, do not always satisfy the principles of positive and negative introspection. (shrink)

This paper focuses on studying containment control problem with switching communication graphs of continuous-time heterogeneous multiagent systems where the control inputs are constrained in a nonconvex set. A nonlinear projection algorithm is proposed to address the problem. We discuss the stability and containment control of the system with switching topologies and nonconvex control input constraints under three different conditions. It is shown that all agents converge to the convex hull of the given leaders ultimately while staying in the nonconvex (...) set under the premise that at least one directed path from leaders to the agents exists in each bounded time interval. Finally, the validity of the results obtained in this paper is verified by simulation. (shrink)

This study aimed to synthesize literature data on male judo combat time in international competitions between 2010 and 2019. The search was carried out from May 8th to June 11th, 2021, in electronic databases using the following keywords: AND. After the selection process, 8 articles were included in the systematic review and 7 in the meta-analysis. These studies analyzed 2,562 international male judo combats over the years 2010 to 2019. We observed that the average male judo combat time changed after (...) each rule change. There was a significant difference between combats that ended up to the regular time and those that needed overtime. There were differences between 60kg and +100kg categories and the others in 2011-2012. However, no significant difference was found between the combat time by weight division after the 2017 rule changes, although there are still differences in relation to the end of the combats. There were significant changes in the male judo combat time with each rule change, and the data from the included studies point to a trend of homogeneity in the combat time spent between the weight divisions over the years, and an increase in the occurrence of Golden Score. More studies need to be carried out to identify the new temporal behaviors of athletes. (shrink)

S There is a long tradition of representing causal relationships by directed acyclic graphs (Wright, 1934 ). Spirtes ( 1994), Spirtes et al. ( 1993) and Pearl & Verma ( 1991) describe procedures for inferring the presence or absence of causal arrows in the graph even if there might be unobserved confounding variables, and/or an unknown time order, and that under weak conditions, for certain combinations of directed acyclic graphs and probability distributions, are asymptotically, in sample size, consistent. (...) These results are surprising since they seem to contradict the standard statistical wisdom that consistent estimators of causal effects do not exist for nonrandomised studies if there are potentially unobserved confounding variables. We resolve the apparent incompatibility of these views by closely examining the asymptotic properties of these causal inference procedures. We show that the asymptotically consistent procedures are ‘pointwise consistent’, but ‘uniformly consistent’ tests do not exist. Thus, no finite sample size can ever be guaranteed to approximate the asymptotic results. We also show the nonexistence of valid, consistent confidence intervals for causal effects and the nonexistence of uniformly consistent point estimators. Our results make no assumption about the form of the tests or estimators. In particular, the tests could be classical independence tests, they could be Bayes tests or they could be tests based on scoring methods such as  or . The implications of our results for observational studies are controversial and are discussed briefly in the last section of the paper. The results hinge on the following fact: it is possible to find, for each sample size n, distributions P and Q such that P and Q are empirically indistinguishable and yet P and Q correspond to different causal effects. (shrink)

In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain choice (...) principles such as co-finite choice, discrete choice, interval choice, compact choice and closed choice, which are cornerstones among Weihrauch degrees and it turns out that certain core theorems in analysis can be classified naturally in this structure. In particular, we study theorems such as the Intermediate Value Theorem, the Baire Category Theorem, the Banach Inverse Mapping Theorem, the Closed Graph Theorem and the Uniform Boundedness Theorem. We also explore how existing classifications of the Hahn—Banach Theorem and Weak Kőnig's Lemma fit into this picture. Well-known omniscience principles from constructive mathematics such as LPO and LLPO can also naturally be considered as Weihrauch degrees and they play an important role in our classification. Based on this we compare the results of our classification with existing classifications in constructive and reverse mathematics and we claim that in a certain sense our classification is finer and sheds some new light on the computational content of the respective theorems. Our classification scheme does not require any particular logical framework or axiomatic setting, but it can be carried out in the framework of classical mathematics using tools of topology, computability theory and computable analysis. We develop a number of separation techniques based on a new parallelization principle, on certain invariance properties of Weihrauch reducibility, on the Low Basis Theorem of Jockusch and Soare and based on the Baire Category Theorem. Finally, we present a number of metatheorems that allow to derive upper bounds for the classification of the Weihrauch degree of many theorems and we discuss the Brouwer Fixed Point Theorem as an example. (shrink)

n my adopted home of Puritan New England, I have learned that personal indulgence is a vice to be tolerated only at rare intervals. Combine this stricture with two further principles and this essay achieves its rationale: first, that we celebrate in hundreds and their easy multiples (the Columbian quincentenary and the fiftieth anniversary of DiMaggio's hitting streak—both about equally important, and only the latter an unambiguous good); second, that geologists learn to take the long view.

We introduce a novel expansion of the four-valued Belnap–Dunn logic by a unary operator representing reductio ad contradictionem and study its algebraic semantics. This expansion thus contains both the direct, non-inferential negation of the Belnap–Dunn logic and an inferential negation akin to the negation of Johansson’s minimal logic. We formulate a sequent calculus for this logic and introduce the variety of reductio algebras as an algebraic semantics for this calculus. We then investigate some basic algebraic properties of this variety, in (...) particular we show that it is locally finite and has EDPC. We identify the subdirectly irreducible algebras in this variety and describe the lattice of varieties of reductio algebras. In particular, we prove that this lattice contains an interval isomorphic to the lattice of classes of finite non-empty graphs with loops closed under surjective graph homomorphisms. (shrink)

This paper investigates the event-based consensus problem for the heterogeneous hybrid multiagent system. First, the heterogeneous hybrid MAS is proposed which contains continuous and discrete-time subsystems with second-order and first-order heterogeneous dynamics. Second, the event-triggered protocols are proposed, which mainly include the event-based control laws and event-triggered conditions for different kinds of agents. Then, the consensus conclusions of fixed topology and switching topologies are obtained based on graph theory and nonnegative matrix theory, which include the constraints on control parameters, coupling (...) gains, and sampling interval to guarantee consensus. Finally, a simulation example is given to verify the efficiency of the proposed protocols. (shrink)

We study the complexity of the classification problem of conjugacy on dynamical systems on some compact metrizable spaces. Especially we prove that the conjugacy equivalence relation of interval dynamical systems is Borel bireducible to isomorphism equivalence relation of countable graphs. This solves a special case of Hjorth’s conjecture which states that every orbit equivalence relation induced by a continuous action of the group of all homeomorphisms of the closed unit interval is classifiable by countable structures. We also (...) prove that conjugacy equivalence relation of Hilbert cube homeomorphisms is Borel bireducible to the universal orbit equivalence relation. (shrink)

In Pninis grammar of Sanskrit one finds the ivastras, a table which defines the natural classes of phonological segments in Sanskrit by intervals. We present a formal argument which shows that, using his representation method, Pninis way of ordering the phonological segments to represent the natural classes is optimal. The argument is based on a strictly set-theoretical point of view depending only on the set of natural classes and does not explicitly take into account the phonological features of the segments, (...) which are, however, implicitly given in the way a language clusters its phonological inventory. The key idea is to link the graph of the Hasse-diagram of the set of natural classes closed under intersection to ivastra-style representations of the classes. Moreover, the argument is so general that it allows one to decide for each set of sets whether it can be represented with Pninis method. Actually, Pnini had to modify the set of natural classes to define it by the ivastras (the segment h plays a special role). We show that this modification was necessary and, in fact, the best possible modification. We discuss how every set of classes can be modified in such a way that it can be defined in a ivastra-style representation.1. (shrink)

Metrics and their weaker forms are used to measure the difference between two data. There are many metrics that are available but not desired by a practitioner. This paper recommends in a plausible reasoning manner an easy-to-understand method to construct desired distance-like measures: to fuse easy-to-obtain pseudo-semi-metrics, pseudo-metrics, or metrics by making full use of well-known t-norms, t-conorms, aggregation operators, and similar operators. The simple reason to do this is that data for a real world problem are sometimes from multiagents. (...) A distance-like notion, called weak interval-valued pseudo-metrics, is defined by using known notions of pseudo-semi-metrics, pseudo-metrics, and metrics; this notion is topologically good and shows precision, flexibility, and compatibility than single pseudo-semi-metrics, pseudo-metrics, or metrics. Propositions and detailed examples are given to illustrate how to fabricate an expected or demanded WIVP-metric in practical problems, and WIVP-metric and its special cases are characterized by using axioms. Moreover, some WIVP-metrics pertinent to quantitative logic theory or interval-valued fuzzy graphs are constructed, and fixed point theorems and common fixed point theorems in weak interval-valued metric spaces are also presented. Topics and strategies for further study are also put forward concretely and clearly. (shrink)

This paper investigates a distributed coordination control for a class of high-order uncertain multiagent systems. Under the framework of iterative learning control, a novel fully distributed learning protocol is devised for the coordination problem of MASs including time-varying parameter uncertainties as well as actuator saturations. Meanwhile, the learning updating laws of various parameters are proposed. Utilizing Lyapunov theory and combining with Graph theory, the proposed algorithm can make each follower track a leader completely over a limited time interval even (...) though each follower is without knowing the dynamics of the leader. Moreover, the extension to formation control is made. The validity and feasibility of the algorithm are verified conclusively by two examples. (shrink)

Cloud computing deals with voluminous heterogeneous data, and there is a need to effectively distribute the load across clusters of nodes to achieve optimal performance in terms of resource usage, throughput, response time, reliability, fault tolerance, and so on. The swarm intelligence methodologies use artificial intelligence to solve computationally challenging problems like load balancing, scheduling, and resource allocation at finite time intervals. In literature, sufficient works are being carried out to address load balancing problem in the cloud using traditional (...) swarm intelligence techniques like ant colony optimization, particle swarm optimization, cuckoo search, bat optimization, and so on. But the traditional swarm intelligence techniques have issues with respect to convergence rate, arriving at the global optimum solution, complexity in implementation and scalability, which limits the applicability of such techniques in cloud domain. In this paper, we look into performance modeling aspects of some of the recent competitive swarm artificial intelligence based techniques like the whale, spider, dragonfly, and raven which are used for load balancing in the cloud. The results and analysis are presented over performance metrics such as total execution time, response time, resource utilization rate, and throughput achieved, and it is found that the performance of the raven roosting algorithm is high compared to other techniques. (shrink)

The Denjoy integral is an integral that extends the Lebesgue integral and can integrate any derivative. In this paper, it is shown that the graph of the indefinite Denjoy integral f↦∫xaf is a coanalytic non-Borel relation on the product space M[a,b]×C[a,b], where M[a,b] is the Polish space of real-valued measurable functions on [a,b] and where C[a,b] is the Polish space of real-valued continuous functions on [a,b]. Using the same methods, it is also shown that the class of indefinite Denjoy integrals, (...) called ACG∗[a,b], is a coanalytic but not Borel subclass of the space C[a,b], thus answering a question posed by Dougherty and Kechris. Some basic model theory of the associated spaces of integrable functions is also studied. Here the main result is that, when viewed as an ℝ[X]-module with the indeterminate X being interpreted as the indefinite integral, the space of continuous functions on the interval [a,b] is elementarily equivalent to the Lebesgue-integrable and Denjoy-integrable functions on this interval, and each is stable but not superstable, and that they all have a common decidable theory when viewed as ℚ[X]-modules. (shrink)

The purpose of this paper is to open for investigation a range of phenomena familiar from dynamical systems or chaos theory which appear in a simple fuzzy logic with the introduction of self-reference. Within that logic, self-referential sentences exhibit properties of fixed point attractors, fixed point repellers, and full chaos on the [0, 1] interval. Strange attractors and fractals appear in two dimensions in the graphing of pairs of mutually referential sentences and appear in three dimensions in the graphing (...) of mutually referential triples. (shrink)

This book is the sixth volume in the series of Collected Papers on Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Building upon the foundational contributions of previous volumes, this edition focuses on the exploration and development of Various New Uncertain Concepts, further enriching the study of uncertainty and complexity through innovative theoretical advancements and practical applications. The volume is meticulously organized into 15 chapters, each presenting unique perspectives and contributions to the field. From (...) theoretical explorations to real-world applications, these chapters provide a cohesive and comprehensive overview of the state of the art in uncertain combinatorics, emphasizing the versatility and power of the newly introduced concepts and methodologies. The first chapter (SuperHypertree-depth – Structural Analysis in SuperHyperGraphs) explores the concept of SuperHypertree-depth, an extension of the classical graph parameter Tree-depth and its hypergraph counterpart Hypertree-depth. By introducing hierarchical nesting within SuperHyperGraphs, where both vertices and edges can represent recursive subsets, this study investigates the mathematical properties and structural implications of these extended parameters. The findings highlight the relationships between SuperHypertree-depth and its traditional graph-theoretic equivalents, providing a deeper understanding of their applicability to hierarchical and complex systems. The second chapter (Obstructions for Hypertree-width and SuperHypertree-width) examines the role of ultrafilters as obstructions in determining Hypertree-width and extends the concept to SuperHypertree-width. Building on hypergraph theory, which abstracts traditional graph frameworks into more complex domains, the study investigates how recursive structures within SuperHyperGraphs redefine the computational and structural properties of these parameters. Ultrafilters, with their broad mathematical significance, serve as critical tools for understanding the limitations and potentials of these advanced graph metrics. The third chapter (SuperHypertree-Length and SuperHypertree-Breadth in SuperHyperGraphs) investigates the extension of the graph-theoretic parameters Tree-length and Tree-breadth to the realms of hypergraphs and SuperHyperGraphs. By leveraging the hierarchical nesting of SuperHyperGraphs, the study explores how these parameters adapt to increasingly complex and multi-level structures. Comparative analyses between these extended parameters and their classical counterparts reveal new insights into their relevance and utility in advanced graph and hypergraph theory. Plithogenic Sets, which generalize Fuzzy and Neutrosophic Sets, are extended in the fourth chapter (Extended HyperPlithogenic Sets and Generalized Plithogenic Graphs) to Extended Plithogenic Sets, HyperPlithogenic Sets, and SuperHyperPlithogenic Sets. This study further investigates their application to graph theory through the concepts of Extended Plithogenic Graphs and Generalized Extended Plithogenic Graphs. The chapter provides a concise exploration of these frameworks, offering insights into their potential for addressing uncertainty and complexity in graph structures. Soft Sets provide an effective framework for decision-making by mapping parameters to subsets of a universal set, addressing uncertainty and vagueness. The fifth chapter (Double-Framed Superhypersoft Set and Double-Framed Treesoft Set) introduces the Double-Framed SuperHypersoft Set and the Double-Framed Treesoft Set as extensions of traditional and advanced soft set frameworks, such as Hypersoft and SuperHypersoft Sets. The chapter explores their relationships with existing concepts, offering new tools to handle complex decision-making scenarios with enhanced structural flexibility. The sixth paper (HyperPlithogenic Cubic Set and SuperHyperPlithogenic Cubic Set) introduces the concepts of the HyperPlithogenic Cubic Set and SuperHyperPlithogenic Cubic Set, which extend the Plithogenic Cubic Set by integrating both interval-valued and single-valued fuzzy memberships. These sets leverage multi-attribute aggregation techniques inherent to plithogenic structures, allowing for nuanced representations of uncertainty. Additionally, related constructs such as the HyperPlithogenic Fuzzy Cubic Set, HyperPlithogenic Intuitionistic Fuzzy Cubic Set, and HyperPlithogenic Neutrosophic Cubic Set are explored, further enriching the theoretical and practical applications of this framework. The seventh chapter (L-Neutrosophic Sets and Nonstationary Neutrosophic Sets) extends the foundational concepts of fuzzy sets by integrating Neutrosophic and Plithogenic frameworks. By introducing L-Neutrosophic Sets and Nonstationary Neutrosophic Sets, the study enhances the representation of uncertainty through independent membership components: truth, indeterminacy, and falsity. These advanced constructs also incorporate multi-dimensional and contradictory attributes, providing a robust means of modeling complex decision-making and uncertain data. Plithogenic and Rough Sets, known for generalizing uncertainty modeling and classification, are extended in the eight chapter (Forest HyperPlithogenic and Forest HyperRough Sets) to Forest HyperPlithogenic Sets, Forest SuperHyperPlithogenic Sets, Forest HyperRough Sets, and Forest SuperHyperRough Sets. These frameworks incorporate hierarchical and recursive structures to advance existing set-theoretic paradigms. The chapter explores their applications in multi-level data analysis and uncertainty classification, demonstrating their adaptability to complex systems. Building on Fuzzy, Neutrosophic, and Plithogenic Sets, the tenth chapter (Symbolic HyperPlithogenic Sets) introduces Symbolic HyperPlithogenic Sets and Symbolic n-SuperHyperPlithogenic Sets. These sets incorporate symbolic components and algebraic coefficients, enabling flexible operations within a defined prevalence order. By extending symbolic representation into hyperplithogenic and superhyperplithogenic domains, the chapter opens new pathways for addressing uncertainty and hierarchical complexity in mathematical modeling. Soft Sets, designed to manage uncertainty and imprecision, have evolved through various extensions like Hypersoft Sets and SuperHypersoft Sets. The eleventh chapter (N-SuperHypersoft and Bijective SuperHypersoft Sets) introduces N-SuperHypersoft Sets, N-Treesoft Sets, Bijective SuperHypersoft Sets, and Bijective Treesoft Sets. These new constructs enhance decision-making frameworks by incorporating advanced hierarchical and bijective relationships, building on existing theories and expanding their applications. Plithogenic Sets, known for integrating multi-valued attributes and contradictions, and Rough Sets, which partition data into definable approximations, are combined in the twelfth chapter (Plithogenic Rough Sets) to form Plithogenic Rough Sets. This fusion provides a powerful framework for addressing uncertainty in dynamic and complex decision-making scenarios, offering a novel approach to uncertainty modeling. Expanding on Neutrosophic Sets, which represent truth, indeterminacy, and falsehood, this chapter introduces Plithogenic Duplets and Plithogenic Triplets. These constructs leverage the Plithogenic framework to incorporate attributes, values, and contradiction measures. The thirteenth chapter (Plithogenic Duplets and Triplets) examines their relationships with Neutrosophic Duplets and Triplets, offering new tools for multi-dimensional data representation and decision-making. Building on foundational concepts like Rough Sets and Vague Sets, the fourteenth chapter (SuperRough and SuperVague Sets) introduces SuperRough Sets and SuperVague Sets. These generalized frameworks extend uncertainty modeling by incorporating hierarchical structures. The study also demonstrates that SuperRough Sets can evolve into SuperHyperRough Sets, providing further generalizations for advanced data classification and analysis. The fifteenth chapter (Neutrosophic TreeSoft Expert and ForestSoft Sets) revisits the Neutrosophic TreeSoft Set, which combines the hierarchical structure of TreeSoft Sets with the Neutrosophic framework for uncertainty representation. Additionally, it introduces the Neutrosophic TreeSoft Expert Set, incorporating expert knowledge into the model. The chapter also explores the ForestSoft Set and its extension, the Neutrosophic ForestSoft Set, to provide multi-level, tree-structured approaches for complex data representation and analysis. (shrink)

This book represents the fourth volume in the series Collected Papers on Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. This volume specifically delves into the concept of the HyperUncertain Set, building on the foundational advancements introduced in previous volumes. The series aims to explore the ongoing evolution of uncertain combinatorics through innovative methodologies such as graphization, hyperization, and uncertainization. These approaches integrate and extend core concepts from fuzzy, neutrosophic, soft, and rough set theories, (...) providing robust frameworks to model and analyze the inherent complexity of real-world uncertainties. At the heart of this series lies combinatorics and set theory—cornerstones of mathematics that address the study of counting, arrangements, and the relationships between collections under defined rules. Traditionally, combinatorics has excelled in solving problems involving uncertainty, while advancements in set theory have expanded its scope to include powerful constructs like fuzzy and neutrosophic sets. These advanced sets bring new dimensions to uncertainty modeling by capturing not just binary truth but also indeterminacy and falsity. In this fourth volume, the integration of set theory with graph theory takes center stage, culminating in "graphized" structures such as hypergraphs and superhypergraphs. These structures, paired with innovations like Neutrosophic Oversets, Undersets, Offsets, and the Nonstandard Real Set, extend the boundaries of mathematical abstraction. This fusion of combinatorics, graph theory, and uncertain set theory creates a rich foundation for addressing the multidimensional and hierarchical uncertainties prevalent in both theoretical and applied domains. The book is structured into thirteen chapters, each contributing unique perspectives and advancements in the realm of HyperUncertain Sets and their related frameworks. -/- The first chapter (Advancing Traditional Set Theory with Hyperfuzzy, Hyperneutrosophic, and Hyperplithogenic Sets) explores the evolution of classical set theory to better address the complexity and ambiguity of real-world phenomena. By introducing hierarchical structures like hyperstructures and superhyperstructures—created through iterative applications of power sets—it lays the groundwork for more abstract and adaptable mathematical tools. The focus is on extending three foundational frameworks: Fuzzy Sets, Neutrosophic Sets, and Plithogenic Sets into their hyperforms: Hyperfuzzy Sets, Hyperneutrosophic Sets, and Hyperplithogenic Sets. These advanced concepts are applied across diverse fields such as statistics, clustering, evolutionary theory, topology, decision-making, probability, and language theory. The goal is to provide a robust platform for future research in this expanding area of study. The second chapter (Applications and Mathematical Properties of Hyperneutrosophic and SuperHyperneutrosophic Sets) extends the work on Hyperfuzzy, Hyperneutrosophic, and Hyperplithogenic Sets by delving into their advanced applications and mathematical foundations. Building on prior research, it specifically examines Hyperneutrosophic and SuperHyperneutrosophic Sets, exploring their integration into: Neutrosophic Logic, Cognitive Maps,Graph Neural Networks, Classifiers, and Triplet Groups. The chapter also investigates their mathematical properties and applicability in addressing uncertainties and complexities inherent in various domains. These insights aim to inspire innovative uses of hypergeneralized sets in modern theoretical and applied research. The third chapter (New Extensions of Hyperneutrosophic Sets – Bipolar, Pythagorean, Double-Valued, and Interval-Valued Sets) studies advanced variations of Neutrosophic Sets, a mathematical framework defined by three membership functions: truth (T), indeterminacy (I), and falsity (F). By leveraging the concepts of Hyperneutrosophic and SuperHyperneutrosophic Sets, the study extends: Bipolar Neutrosophic Sets, Interval-Valued Neutrosophic Sets, Pythagorean Neutrosophic Sets, and Double-Valued Neutrosophic Sets. These extensions address increasingly complex scenarios, and a brief analysis is provided to explore their potential applications and mathematical underpinnings. Building on prior research, the fourth chapter (Hyperneutrosophic Extensions of Complex, Single-Valued Triangular, Fermatean, and Linguistic Sets) expands on Neutrosophic Set theory by incorporating recent advancements in Hyperneutrosophic and SuperHyperneutrosophic Sets. The study focuses on extending: Complex Neutrosophic Sets, Single-Valued Triangular Neutrosophic Sets, Fermatean Neutrosophic Sets, and Linguistic Neutrosophic Sets. The analysis highlights the mathematical structures of these hyperextensions and explores their connections with existing set-theoretic concepts, offering new insights into managing uncertainty in multidimensional challenges. The fifth chapter (Advanced Extensions of Hyperneutrosophic Sets – Dynamic, Quadripartitioned, Pentapartitioned, Heptapartitioned, and m-Polar) delves deeper into the evolution of Neutrosophic Sets by exploring advanced frameworks designed for even more intricate applications. New extensions include: Dynamic Neutrosophic Sets, Quadripartitioned Neutrosophic Sets, Pentapartitioned Neutrosophic Sets, Heptapartitioned Neutrosophic Sets, and m-Polar Neutrosophic Sets. These developments build upon foundational research and aim to provide robust tools for addressing multidimensional and highly nuanced problems. The sixth chapter (Advanced Extensions of Hyperneutrosophic Sets – Cubic, Trapezoidal, q-Rung Orthopair, Overset, Underset, and Offset) builds upon the Neutrosophic framework, which employs truth (T), indeterminacy (I), and falsity (F) to address uncertainty. Leveraging advancements in Hyperneutrosophic and SuperHyperneutrosophic Sets, the study extends: Cubic Neutrosophic Sets, Trapezoidal Neutrosophic Sets, q-Rung Orthopair Neutrosophic Sets, Neutrosophic Oversets, Neutrosophic Undersets, and Neutrosophic Offsets. The chapter provides a brief analysis of these new set types, exploring their properties and potential applications in solving multidimensional problems. The seventh chapter (Specialized Classes of Hyperneutrosophic Sets – Support, Paraconsistent, and Faillibilist Sets) delves into unique classes of Neutrosophic Sets extended through Hyperneutrosophic and SuperHyperneutrosophic frameworks to tackle advanced theoretical challenges. The study introduces and extends: Support Neutrosophic Sets, Neutrosophic Intuitionistic Sets, Neutrosophic Paraconsistent Sets, Neutrosophic Faillibilist Sets, Neutrosophic Paradoxist and Pseudo-Paradoxist Sets, Neutrosophic Tautological and Nihilist Sets, Neutrosophic Dialetheist Sets, and Neutrosophic Trivialist Sets. These extensions address highly nuanced aspects of uncertainty, further advancing the theoretical foundation of Neutrosophic mathematics. The eight chapter (MultiNeutrosophic Sets and Refined Neutrosophic Sets) focuses on two advanced Neutrosophic frameworks: MultiNeutrosophic Sets, and Refined Neutrosophic Sets. Using Hyperneutrosophic and nn-SuperHyperneutrosophic Sets, these extensions are analyzed in detail, highlighting their adaptability to multidimensional and complex scenarios. Examples and mathematical properties are provided to showcase their practical relevance and theoretical depth. The ninth chapter (Advanced Hyperneutrosophic Set Types – Type-m, Nonstationary, Subset-Valued, and Complex Refined) explores extensions of the Neutrosophic framework, focusing on: Type-m Neutrosophic Sets, Nonstationary Neutrosophic Sets, Subset-Valued Neutrosophic Sets, and Complex Refined Neutrosophic Sets. These extensions utilize the Hyperneutrosophic and SuperHyperneutrosophic frameworks to address advanced challenges in uncertainty management, expanding their mathematical scope and practical applications. The tenth chapter (Hyperfuzzy Hypersoft Sets and Hyperneutrosophic Hypersoft Sets) integrates the principles of Fuzzy, Neutrosophic, and Soft Sets with hyperstructures to introduce: Hyperfuzzy Hypersoft Sets, and Hyperneutrosophic Hypersoft Sets. These frameworks are designed to manage complex uncertainty through hierarchical structures based on power sets, with detailed analysis of their properties and theoretical potential. The eleventh chapter (A Review of SuperFuzzy, SuperNeutrosophic, and SuperPlithogenic Sets) revisits and extends the study of advanced set concepts such as: SuperFuzzy Sets, Super-Intuitionistic Fuzzy Sets,Super-Neutrosophic Sets, and SuperPlithogenic Sets, including their specialized variants like quadripartitioned, pentapartitioned, and heptapartitioned forms. The work serves as a consolidation of existing studies while highlighting potential directions for future research in hierarchical uncertainty modeling. Focusing on decision-making under uncertainty, the tweve chapter (Advanced SuperHypersoft and TreeSoft Sets) introduces six novel concepts: SuperHypersoft Rough Sets,SuperHypersoft Expert Sets, Bipolar SuperHypersoft Sets, TreeSoft Rough Sets, TreeSoft Expert Sets, and Bipolar TreeSoft Sets. Definitions, properties, and potential applications of these frameworks are explored to enhance the flexibility of soft set-based models. The final chapter (Hierarchical Uncertainty in Fuzzy, Neutrosophic, and Plithogenic Sets) provides a comprehensive survey of hierarchical uncertainty frameworks, with a focus on Plithogenic Sets and their advanced extensions: Hyperplithogenic Sets, SuperHyperplithogenic Sets. It examines relationships with other major concepts such as Intuitionistic Fuzzy Sets, Vague Sets, Picture Fuzzy Sets, Hesitant Fuzzy Sets, and multi-partitioned Neutrosophic Sets, consolidating their theoretical interconnections for modeling complex systems. This volume not only reflects the dynamic interplay between theoretical rigor and practical application but also serves as a beacon for future research in uncertainty modeling, offering advanced tools to tackle the intricacies of modern challenges. (shrink)

Positive frequency dependent selection is a natural selection regime where the fitness of a phenotype increases with its frequency in the population. Examples can be typically found in the spread of disease tolerance strategies in a population. A characterizing feature of PFDS is that the focal allele may experience favorable selection only when it becomes more frequent in the population, while being selected against when it is rare. In this paper, by applying a solution concept from evolutionary game theory, (...) we hypothesize that the process of emergence of such alleles triggers selection for silence, where the emergence of alleles that can stay unexpressed for a period of time will be favored by selection forces. We illustrate our hypothesis using a mathematical model of a population of single locus diploid organisms with two alleles where a single mutant of an allele that experiences positive frequency dependent selection appears in a population where the other allele is a dominant. The model results show that the longer the silence interval of the new mutant before its expression, the better its chances of getting fixed in the population. However, this effect will be observable only to a certain limit after which further increase in the interval will not have an effect on the expected fixation rate. Two divergences from the simple scenario are also investigated: the nonsynchronous expression of the focal allele and its emergence in a spatial grid limited by a migration bottleneck. In all cases, it is shown that there is an evolutionary pressure inherent in the dynamics of positive frequency dependent selection on the genes to have a delayed expression. It is hypothesized that the regulation systems of such traits will be under selection for either internal silencing mechanisms or to be triggered by an external environmental condition. (shrink)

Tolerance is generally regarded as an unqualified achievement of the modern West. Emerging in early modern Europe to defuse violent religious conflict and reduce persecution, tolerance today is hailed as a key to decreasing conflict across a wide range of other dividing lines-- cultural, racial, ethnic, and sexual. But, as political theorist Wendy Brown argues in Regulating Aversion, tolerance also has dark and troubling undercurrents. Dislike, disapproval, and regulation lurk at the heart of tolerance. To tolerate (...) is not to affirm but to conditionally allow what is unwanted or deviant. And, although presented as an alternative to violence, tolerance can play a part in justifying violence--dramatically so in the war in Iraq and the War on Terror. Wielded, especially since 9/11, as a way of distinguishing a civilized West from a barbaric Islam, tolerance is paradoxically underwriting Western imperialism. Brown's analysis of the history and contemporary life of tolerance reveals it in a startlingly unfamiliar guise. Heavy with norms and consolidating the dominance of the powerful, tolerance sustains the abjection of the tolerated and equates the intolerant with the barbaric. Examining the operation of tolerance in contexts as different as the War on Terror, campaigns for gay rights, and the Los Angeles Museum of Tolerance, Brown traces the operation of tolerance in contemporary struggles over identity, citizenship, and civilization. (shrink)

We invoke the ideal of tolerance in response to conflict, but what does it mean to answer conflict with a call for tolerance? Is tolerance a way of resolving conflicts or a means of sustaining them? Does it transform conflicts into productive tensions, or does it perpetuate underlying power relations? To what extent does tolerance hide its involvement with power and act as a form of depoliticization? Wendy Brown and Rainer Forst debate the uses and misuses (...) of tolerance, an exchange that highlights the fundamental differences in their critical practice despite a number of political similarities. Both scholars address the normative premises, limits, and political implications of various conceptions of tolerance. Brown offers a genealogical critique of contemporary discourses on tolerance in Western liberal societies, focusing on their inherent ties to colonialism and imperialism, and Forst reconstructs an intellectual history of tolerance that attempts to redeem its political virtue in democratic societies. Brown and Forst work from different perspectives and traditions, yet they each remain wary of the subjection and abnegation embodied in toleration discourses, among other issues. The result is a dialogue rich in critical and conceptual reflections on power, justice, discourse, rationality, and identity. (shrink)

Why does one hear so much about tolerance today, when as little as a few decades ago it was considered an obsolete virtue, anachronistic and outstripped by the progress of our civilization? When a virtue is lacking we remember it most! Must we conclude from the emphasis placed on tolerance these last few years that we have entered an era of generalized mutual incomprehension? The conquests of the intellect; local, national and international juridical practices; education open to global (...) issues; the intermixing of humanity that has never before “moved” so much under the combined effect of emigration; tourism and the developments in transportation and vast information exchanges served by efficient techniques that make communication one of the greatest benefits of our culture; all this could have led mankind into a surplus of exchanges on all levels, and better mutual appreciation leading to more tolerance. (shrink)

We all make mistakes in pronunciation and spelling, but a common view is that there are limits beyond which a mistaken pronunciation or spelling becomes too dramatic to be recognized as of a particular word at all. These considerations have bolstered a family of accounts that invoke speaker intentions and standards for tolerance as determinants of which word, if any, an utterance tokens. I argue this is a mistake. Neither intentions nor standards of tolerance are necessary or sufficient (...) (individually or jointly) for determining which word an utterance tokens. Instead, drawing in part on empirical research on word production, I offer an alternative account, Originalism-plus-Transfer (OPT), according to which word tokening depends entirely on lexical selection during word production, and on how the selected lexical item is situated within the network of causal/historical connections leading back to its neologizing. Once the elements of my account are in place, as a bonus, we will have resources for a promising answer to the question of word individuation as well. (shrink)

Weber, Colyvan, and Priest have advanced glutty approaches to the sorites, on which the truth about the penumbral region of a soritical series is inconsistent. The major benefit of a glut-based approach is maintaining the truth of all sorites premisses while none the less avoiding, in a principled fashion, the absurdity of the sorites conclusion. I agree that this is a major virtue of the target glutty approach; however, I think that it can be had without gluts. If correct, this (...) result weighs heavily against the proposed glutty approach, at least given the default-consistency principle that all target glutty philosophers accept: posit gluts only if there is no consistent theory that enjoys the same virtues as the would-be glutty solution. (shrink)

Almost all philosophical understandings of tolerance as forbearance require that the reasons for objection and/or the reasons for withholding the power to negatively interfere must be of the morally right kind. In this paper, I instead put forward a descriptive account of an act of tolerance and argue that in the political context, at least, it has several important advantages over the standard more moralised accounts. These advantages include that it better addresses instances of intolerance and that it (...) is able to makes sense of state acts of tolerance. (shrink)

These essays in political philosophy by T. M. Scanlon, written between 1969 and 1999, examine the standards by which social and political institutions should be justified and appraised. Scanlon explains how the powers of just institutions are limited by rights such as freedom of expression, and considers why these limits should be respected even when it seems that better results could be achieved by violating them. Other topics which are explored include voluntariness and consent, freedom of expression, tolerance, punishment, (...) and human rights. The collection includes the classic essays 'Preference and Urgency', 'A Theory of Freedom of Expression', and 'Contractualism and Utilitarianism', as well as a number of other essays that have hitherto not been easily accessible. It will be essential reading for all those studying these topics from the perspective of political philosophy, politics, and law. (shrink)

When an activity is unwanted, administrators often adopt a zero tolerance policy towards that activity. The background assumption is that, by adopting a zero tolerance policy, one is doing everything that one can to reduce or eliminate the activity in question. Yet which policy best serves to reduce an unwanted behavior is always an empirical question. Thus, those who adopt a zero tolerance policy towards some behavior without first investigating and finding that they are in a set (...) of circumstances where that policy is the most cost-effective way of reducing or eliminating the undesirable behavior are committing the zero tolerance fallacy. (shrink)

This paper examines the notion of tolerance in education. In general, tolerance is perceived as a means to resist hostility, raise awareness of cultural differences, mitigate violence, and maintain liberal and democratic values. In education, there are various initiatives, such as the International Day for Tolerance (UNESCO in Declaration of principles on tolerance, 1995), that aim to build resilience against different forms of hate and cultivate openness and acceptance of the other. Yet the idea of (...) class='Hi'>tolerance includes different understandings and interpretations. This paper argues that cultivating an embodied sense of tolerance among students, in particular in divisive communities, requires us to move beyond deliberative interpretations of tolerance and to advance a pragmatic understanding of tolerance through an agonistic lens. This paper starts with a review of several dominant interpretations of tolerance. The heart of the paper focuses on interpreting Dewey’s pragmatism as a theoretical basis for advancing tolerance. The final part of the paper explores how pragmatism through an agonistic lens can support a more flexible and humane approach to dealing with political conflicts. (shrink)

Previous asymptotically correct algorithms for recovering causal structure from sample probabilities have been limited even in sparse graphs to a few variables. We describe an asymptotically correct algorithm whose complexity for fixed graph connectivity increases polynomially in the number of vertices, and may in practice recover sparse graphs with several hundred variables. From..

Adverbial modification is probably one of the least understood areas of linguistics. The essays in this volume all address the problem of how to give an analysis of adverbial modifiers within truth-conditional semantics. Chapters I-VI provide analyses of particular modifiers within a possible worlds framework, and were written between 1974 and 1981. Original publication details of these chapters may be found on p. vi. Of these, all but Chapter I make essential use of the idea that the time reference involved (...) in tensed sentences should be a time interval rather than a single instant. The final chapter (Chapter VII) was written especially for this volume and investigates the question of how the 'situation semantics' recently devised by Jon Barwise and John Perry, as a rival to possible-worlds semantics, might deal with adverbs. In addition I have included an appendix to Chapter III and an introduction which links all the chapters together. (shrink)

Objective This work disentangles moral tolerance from moral relativism and reveals their distinct personological meanings. Both constructs have long been of interest to moral philosophers, moral psychologists, and everyday people, and they may play prominent roles in the feasibility of modern diverse societies. However, they have been criticized as devaluing morality and as producing overly permissive societies. Moreover, although they lack necessary conceptual implications for each other, they are easily (and often) conflated. -/- Method Three studies included nine samples (...) (total N > 3,200, 40%–50% female, Mage = 38–40, 83% white). Participants completed (online) new measures of moral tolerance and moral relativism, along with measures of 40 additional constructs. -/- Results Results reveal robust psychometric quality of the new measures (the Moral Relativism Scale and the Moral Tolerance Scale), demonstrate that the constructs are empirically overlapping but separable, and highlight their distinct personological networks. Moral relativism was associated with liberal political views and a lowered valuing/enacting of moral values. Moral tolerance was weakly associated with liberal political views but was strongly related to a broad range of both liberal and conservative moral values. -/- Conclusion This work yields new tools for investigating moral character, and it reveals the differential meaning of two important moral constructs. (shrink)

In this paper, I distinguish different kinds of pluralism about logical consequence. In particular, I distinguish the pluralism about logic arising from Carnap’s Principle of Tolerance from a pluralism which maintains that there are different, equally “good” logical consequence relations on the one language. I will argue that this second form of pluralism does more justice to the contemporary state of logical theory and practice than does Carnap’s more moderate pluralism.

The empirical-transcendental debate in philosophy of technology, as debates go, took a turn toward the counterposing of the two perspectives, ‘empirical’-pragmatic-pragmatist versus ‘transcendental’-critical. Postphenomenology aligns itself with the former standpoint, and it is in this spirit that commentators have criticized it for its too-instrumentalist stance and lack of overarching, i.e., transcendental orientation. But the positions may have become too starkly delineated in order for the debate to reach any breakthrough: a seemingly unbridgeable gap yawns between the stances of ‘technology with (...) a small “t”’ and ‘Technology with a capital “T.”' Is there any way to reorient the debate? In this paper I propose to do so by considering whether there would be some way of arriving from one end of the spectrum to the other—crossing the gap. Exploring the purported wasteland in between “technology” and “Technology” by way of object-oriented ontology (OOO)—Harman, Morton—we can find it actually filled with countless gaps, adhering to every thing. Following the radical insights of OOO, we’d have to attest to a ‘thing-transcendentality.’ The ‘gap,’ then, that seemed so threatening and all-encompassing, becomes smeared out, levelled down to a multiplicity of perspectives. And this casts the debate, with its purported strict tension between ‘empirical’ and ‘transcendental’ positions, in fresh terms, opening up new ways for studying how the two interrelate. (shrink)