Logical Extension Research Articles

AI-RADS: Successes and challenges of a novel artificial intelligence curriculum for radiologists across different delivery formats.

Artificial intelligence and data-driven predictive modeling have become increasingly common tools integrated in clinical practice, heralding a new chapter of medicine in the digital era. While these techniques are poised to affect nearly all aspects of medicine, medical education as an institution has languished behind; this has raised concerns that the current training infrastructure is not adequately preparing future physicians for this changing clinical landscape. Our institution attempted to ameliorate this by implementing a novel artificial intelligence in radiology curriculum, "AI-RADS," in two different educational formats: a 7-month lecture series and a one-day workshop intensive. The curriculum was structured around foundational algorithms within artificial intelligence. As most residents have little computer science training, algorithms were initially presented as a series of simple observations around a relatable problem (e.g., fraud detection, movie recommendations, etc.). These observations were later re-framed to illustrate how a machine could apply the underlying concepts to perform clinically relevant tasks in the practice of radiology. Secondary lessons in basic computing, such as data representation/abstraction, were integrated as well. The lessons were ordered such that these algorithms were logical extensions of each other. The 7-month curriculum consisted of seven lectures paired with seven journal clubs, resulting in an AI-focused session every two weeks. The workshop consisted of six hours of content modified for the condensed format, with a final integrative activity. Both formats of the AI-RADS curriculum were well received by learners, with the 7-month version and workshop garnering 9.8/10 and 4.3/5 ratings, respectively, for overall satisfaction. In both, there were increases in perceived understanding of artificial intelligence. In the 7-lecture course, 6/7 lectures achieved statistically significant (P < 0.02) differences, with the final lecture approaching significance (P = 0.07). In the one-day workshop, there was a significant increase in perceived understanding (P = 0.03). As artificial intelligence becomes further enmeshed in clinical practice, it will become critical for physicians to have a basic understanding of how these tools work. Our AI-RADS curriculum demonstrates that it is successful in increasing learner perceived understanding in both an extended and condensed format.

Returning to critical pedagogy in a world of datafication

The COVID-19 pandemic prompted a further extension of the sociotechnical logics of digital platforms to every realm of social life. Given the colonialist, oppressive and exploitative dynamics through which digital platforms work, several scholars supported the need to embrace an openly activist role to help individuals contrast the ways in which they are trapped in loops of dependency and trajectorism. Drawing on the results of 40 auto-ethnographic diaries, this paper showcases the usefulness of critical pedagogical techniques in enhancing critical awareness regarding hegemonic datafication structures, while also arguing that despite a good level of consciousness raising, it remains difficult for people to go beyond subalternity and make more concrete changes in personal and collective behaviors. We contend that to break persistent feelings of dependency, it is necessary to go further with a two-step process combining autoethnographic tools, aimed at increasing critical algorithmic awareness, with the development of data science skills that can help individuals acquiring more precise knowledge schemes and scaling down the power of giant corporations, thereby building individual and collective capacities to use data for developing counter-narratives about possible futures.

Complexity function and complexity of validity of modal and superintuitionistic propositional logics

Abstract We consider the relationship between the algorithmic properties of the validity problem for a modal or superintuitionistic propositional logic and the size of the smallest Kripke countermodels for non-theorems of the logic. We establish the existence, for every degree of unsolvability, of a propositional logic whose validity problem belongs to the degree and whose every non-theorem is refuted on a Kripke frame that validates the logic and has the size linear in the length of the non-theorem. Such logics are obtained among the normal extensions of the propositional modal logics $\textbf {KTB}$, $\textbf {GL}$ and $\textbf {Grz}$ as well as in the lattice of superintuitionistic propositional logics. This shows that the computational complexity of a modal or superintuitionistic propositional logic is, in general, not related to the size of the countermodels for its non-theorems.

Creative commoning: design experiments exploring ways for platform technology to democratise architectural practice and production

Digital platforms are rapidly and surreptitiously transforming the built environment. This paper begins by revealing the ways that platform capitalism is amplifying the financialisation of housing and economic asymmetries in global cities. However, it argues that with creativity, the same tools could be reformulated around the commons to develop an effective ‘counter-power' against these practices and to work towards a future city that is fairer and more sustainable. Through a series of creative works by contemporary architects including Dogma, Open Systems Lab, and Alexander & Sheridan Architecture, this paper seeks to demonstrate Vasilis Kostakis and Michel Bauwens' assertion that ‘the commons' is not an abstract concept, but a logical extension of practices and technologies that have become the everyday conditions of society from working to living. It exposes the potential for platform technologies to redistribute land and housing infrastructure, transform architectural, construction labour, and development practices, and redefine a role for the architect within the post-digital city. Ultimately, I argue that the politics of the platform is a matter of design. Through an expanded approach to architectural practice — which confronts the digital forces at play in the contemporary city — there is potential for architects to re-politicise the term ‘disruption’ towards housing equity and systemic change.

Quashing Racism: Presenting the ‘comprehensive Socio-cultural Persecution Complex’ as a Logical Extension and a Practical Application of the Certainty Uncertainty Principle for the Social Sciences

Quashing Racism: Presenting the ‘comprehensive Socio-cultural Persecution Complex’ as a Logical Extension and a Practical Application of the Certainty Uncertainty Principle for the Social Sciences

Type-2 Neutrosophic Set and Their Applications in Medical Databases Deadlock Resolution

Electronic patient data gives many advantages, but also new difficulties. Deadlocks may delay procedures like acquiring patient information. Distributed deadlock resolution solutions introduce uncertainty due to inaccurate transaction properties. Soft computing-based solutions have been developed to solve this challenge. In a single framework, ambiguous, vague, incomplete, and inconsistent transaction attribute information has received minimal attention. The work presented in this paper employed type-2 neutrosophic logic, an extension of type-1 neutrosophic logic, to handle uncertainty in real-time deadlock-resolving systems. The proposed method is structured to reflect multiple types of knowledge and relations among transactions’ features that include validation factor degree, slackness degree, degree of deadline-missed transaction based on the degree of membership of truthiness, degree of membership of indeterminacy, and degree of membership of falsity. Here, the footprint of uncertainty (FOU) for truth, indeterminacy, and falsity represents the level of uncertainty that exists in the value of a grade of membership. We employed a distributed real-time transaction processing simulator (DRTTPS) to conduct the simulations and conducted experiments using the benchmark Pima Indians diabetes dataset (PIDD). As the results showed, there is an increase in detection rate and a large drop in rollback rate when this new strategy is used. The performance of Type-2 neutrosophic-based resolution is better than the Type-1 neutrosophic-based approach on the execution ratio scale. The improvement rate has reached 10% to 20%, depending on the number of arrived transactions.

АУДИОВИЗУАЛИЗАЦИЯ КУЛЬТУРЫ КАБАРЕ В НЕМОМ КИНО 1900–1920-х

This article is based on a presentation delivered at the 51st Ludmila Verbitskaya International Philological Conference. The study explores the phenomenon of audiovisualization of cabaret culture in silent films of the 1900s to 1920s, examining how it conveyed the concept of the tape to viewers. Notably, there have been no Russian studies dedicated to examining the influence of cabaret on early cinema. In contrast, Western film critics have predominantly focused on the role of cabaret performers, perceiving early cinema as an art form characterized by hysteria, a logical extension of cabaret and its various forms of entertainment. This paper aims to demonstrate, however, that the inclusion of cabaret poses and gestures in films was intentional, serving to enhance the viewing experience and reflect upon the socio-cultural phenomena of the turn of the century, as well as to provide a means of exposing mores through a distinct gestural neurotic system. The research findings indicate that early cinema, particularly films featuring cabaret dances, functioned as polycode texts, accumulating blocked or previously experienced memories through actions and images. It can be argued that the tendency and attraction to the primitive, which was popular in the 1910s and 1920s, first manifested itself in the grassroots dances and was audiovisually expressed through dance movements. The cancan initially incorporated a pathological gestural language, which later became associated with regression in the context of its convergence with African dances, mesmeric practices, and quack discourse.

Bounded Model Checking for Metric Temporal Logic Properties of Timed Automata with Digital Clocks

Metric temporal logic (MTL) is a popular real-time extension of linear temporal logic (LTL). This paper presents a new simple SAT-based bounded model-checking (SAT-BMC) method for MTL interpreted over discrete infinite timed models generated by discrete timed automata with digital clocks. We show a new translation of the existential part of MTL to the existential part of linear temporal logic with a new set of atomic propositions and present the details of the new translation. We compare the new method's advantages to the old method based on a translation of the hard reset LTL (HLTL). Our method does not need new clocks or new transitions. It uses only one path and requires a smaller number of propositional variables and clauses than the HLTL-based method. We also implemented the new method, and as a case study, we applied the technique to analyze several systems. We support the theoretical description with the experimental results demonstrating the method's efficiency.

Satisfiability and Model Checking for One Parameterized Extension of Linear Temporal Logic

Satisfiability and Model Checking for One Parameterized Extension of Linear Temporal Logic

A Review of Synthetic Image Data and Its Use in Computer Vision.

Development of computer vision algorithms using convolutional neural networks and deep learning has necessitated ever greater amounts of annotated and labelled data to produce high performance models. Large, public data sets have been instrumental in pushing forward computer vision by providing the data necessary for training. However, many computer vision applications cannot rely on general image data provided in the available public datasets to train models, instead requiring labelled image data that is not readily available in the public domain on a large scale. At the same time, acquiring such data from the real world can be difficult, costly to obtain, and manual labour intensive to label in large quantities. Because of this, synthetic image data has been pushed to the forefront as a potentially faster and cheaper alternative to collecting and annotating real data. This review provides general overview of types of synthetic image data, as categorised by synthesised output, common methods of synthesising different types of image data, existing applications and logical extensions, performance of synthetic image data in different applications and the associated difficulties in assessing data performance, and areas for further research.

The techfare state: debt, discipline, and accelerated neoliberalism

ABSTRACT In this exploratory article, we aim to open a research agenda for renewed attention to the relationship between the capitalist state and the technology ecosystem. Over the last decade, private technology companies have increasingly become enmeshed with the activities of the state in arenas such as policing, healthcare, and welfare administration. At a time when so many facets of state activity are being infiltrated by technology firms and their products, we ask how we should theorise the relationship between the capitalist state and technology capital? This paper develops one approach to answer this question by aligning the priorities of tech capital with those of the neoliberal state namely, through the disciplining and managing of the relative surplus population. In this arena, we argue, a form of techfare has begun to take shape: a technology-assisted extension and intensification of the disciplinary logics that work to lock the relative surplus population into exploitative market relations and punitive institutions in advanced capitalist countries like the United States. We explore techfare and the disciplining of labour through two avenues: the business of consumer finance vis-à-vis debt and credit instruments, and various forms of tech-enabled strategies of law-enforcement.

Black/African Science Fiction and the Quest for Racial Justice through Legal Knowledge: How Can We Unsettle Euro-modern Time and Temporality in Our Teaching?

This paper argues that the relationship between law, time, temporality, race and racism is vital to understanding the continuous reproduction of racial injustice and the making permanent of colonial logics. This entanglement is exemplified in the extension, recreation and adaptation of those colonial logics of the human and space-time beyond the time of both racialised enslavement and exploitative colonisation. This paper further argues that the absence of a detailed and central examination of these junctures within legal knowledge – especially in teaching but also in research – can be addressed by recourse to science fiction. A specific area of science fiction, collectively termed here Black/African Science Fiction, has made inroads into unsettling Euro-modern law’s chronopolitics. Using Octavia Butler’s Kindred as an example, this paper argues that Black/African Science Fiction can help us to reframe legal knowledge to disrupt the inevitability of our current version of the future and the question of inevitability itself.

An Analytic Propositional Proof System on Graphs

In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This means that we lose the tree structure of the formulas corresponding to the cographs, and we can no longer use standard proof theoretical methods that depend on that tree structure. In order to overcome this difficulty, we use a modular decomposition of graphs and some techniques from deep inference where inference rules do not rely on the main connective of a formula. For our proof system we show the admissibility of cut and a generalisation of the splitting property. Finally, we show that our system is a conservative extension of multiplicative linear logic with mix, and we argue that our graphs form a notion of generalised connective.

La concepción de información de Peirce entre 1867-1869

Peirce’s analyses of the concept of information begin in the period from 1865 to 1869 and continue until the last years of his life. In fact, the successive phases that the scholars distinguish about Peirce’s approaches to information, roughly match Fisch’s periodization of Peirce’s philosophical development. In the first phase his approach is restricted to the proposition and the terms that knock it into shape; the forms of inference prevail. In the second phase the concept of information is enriched with the development of Peirce’s semiotic theory and his typology of signs. By last, his concept of information receives a more decidedly metaphysical stamp. In this paper we will just expose Peirce’s conception of information during the first of these phases, foregrounding his papers Upon Logical Comprehension and Extension (W2 [1867]: 70-86) and Questions on Reality (W2 [1868]: 162-87). Here, individuals explore and actualize possibilities in thought, once they articulate their experience through a social system of signs. That’s why, in inferring, “we ought to say that we are in thought, and not that thoughts are in us” (EP 1 [1868]: 42).

On Kripke completeness of modal predicate logics around quantified K5

The paper studies completeness and incompleteness of modal predicate logics in Kripke semantics, especially for logics of the form QΛ, minimal predicate extensions of modal propositional logics. We show that QΛ is incomplete for a continual family of logics Λ above K+□(□p→p), in particular for well-known K5 and K45. On the other hand, in some cases we find completions of QΛ; they are obtained by adding a single extra axiom. Completeness proofs use canonical models, with some modifications, and the case of QK5 is the most interesting from the technical side. We also introduce the “boxing” operation for modal predicate logics and prove transfer results for Kripke and Kripke sheaf completeness with respect to this operation.

“Chiralized” Cu and Ni Deposits Obtained Via Electroless Deposition

The study of physicochemical processes at chiral surfaces is a particularly intriguing field of science.1,2 Of course, a logical and natural extension is the study of the electrochemical behavior of a “chiral-electrode”|solution interface, which is the subject of rapidly growing scientific and applicative interest in electrochemistry.3–6 In physics (and biology too), the concept of chirality, and the relevant involvement of physical interactions ruling chiral-systems is fascinating field of science: Maxwell equations, light polarization to mention a few (in biology, the homochirality dilemma7). Besides the purely fascinating scientific aspects, in chemistry chirality means a concept able to rule asymmetric synthesis and enantioselectivity/enantio-recognition (sensors). Within the area of chirality, it was shown that chiral systems are able to interact selectively with spin-polarized electrons8 acting also as spin-filter: chiral induced spin-selectivity (CISS).9 As a rational development, the implementation of the chiral spin-selectivity in electrochemistry, lead to the so-called spin-dependent electrochemistry.10 Quite recently where surfaces functionalized with chiral molecules shown better charge transfer properties if compared with structurally similar achiral compounds.11 Moreover, “chiralized” (which means co-deposition with a chiral-inducer compound) electrodeposited nickel and electropolymerized aniline (PANI), showed both good enantioselectivity as well as spin filtering (magnetoresistance measurements) characteristics.12–14 In this paper we want to prepare “chiralized” metals by electroless co-deposition of a suitable metal (here Cu and Ni) with an enantiopure chiral molecule: asymmetry inducer. This aiming to deposit a chiral conductive (metallic and possibly ferromagnetic) surface on a non-conductive material, in view of applications in both energy (photovoltaic) and spintronics (spin-valve) applications. In general, electroless deposition of both Cu and Ni relies on the use of Pd salts (where the real “catalyst” are Pd metallic nanoparticles), this makes the electroless procedure quite expensive. At present, in our laboratory the electroless deposition of both Cu and Ni was successfully carried out using Ag nanoparticles as the catalyzer, Figure 1. Co-deposition in the presence of enantiopure organic compounds is under investigations. References A. J. Gellman, Acc. Mater. Res., 2, 1024–1032 (2021).D. Avnir, Advanced Materials, 30, 1706804 (2018).C. Wattanakit et al., Nature Communications, 5, ncomms4325 (2014).H. Moshe et al., Chem. Eur. J., 19, 10295–10301 (2013).H. Moshe, G. Levi, D. Sharon, and Y. Mastai, Surface Science, 629, 88–93 (2014).S. Arnaboldi, M. Magni, and P. R. Mussini, Current Opinion in Electrochemistry, 8, 60–72 (2018).G. Laurent, D. Lacoste, and P. Gaspard, PNAS, 118 (2021) https://www.pnas.org/content/118/3/e2012741118.S. Mayer, C. Nolting, and J. Kessler, J. Phys. B: At. Mol. Opt. Phys., 29, 3497–3511 (1996).K. Ray, S. P. Ananthavel, D. H. Waldeck, and R. Naaman, Science, 283, 814–816 (1999).D. Mishra et al., Proceedings of the National Academy of Sciences, 110, 14872–14876 (2013).M. Innocenti et al., Journal of Electroanalytical Chemistry, 856, 113705 (2020).M. Gazzotti et al., Electrochimica Acta, 286, 271–278 (2018).S. Mishra et al., Small Methods, 4, 2070038 (2020).S. Mishra, L. Pasquali, and C. Fontanesi, Appl. Phys. Lett., 118, 224001 (2021). Figure 1

Reactive and Risk-Aware Control for Signal Temporal Logic

The deployment of autonomous systems in uncertain and dynamic environments has raised fundamental questions. Addressing these is pivotal to build fully autonomous systems and requires a systematic integration of planning and control. We first propose reactive risk signal interval temporal logic (ReRiSITL) as an extension of signal temporal logic (STL) to formulate complex spatiotemporal specifications. Unlike STL, ReRiSITL allows to consider uncontrollable propositions that may model humans as well as random environmental events such as sensor failures. Additionally, ReRiSITL allows to incorporate risk measures, such as (but not limited to) the conditional value-at-risk, to measure the risk of violating certain spatial specifications. Second, we propose an algorithm to check if an ReRiSITL specification is satisfiable. For this purpose, we abstract the ReRiSITL specification into a timed signal transducer and devise a game-based approach. Third, we propose a reactive planning and control framework for dynamical control systems under ReRiSITL specifications.

A Fuzzy AHP Approach to Compare Transit System Performance in US Urbanized Areas

Public transit systems in the United States often face multiple policy objectives. Typically, stakeholders desire frequent service on an extensive network, but funding and other resources are constrained, creating complicated relationships between service effectiveness goals and business efficiency goals. Using data from the National Transit Map (NTM), this study evaluated the general performance of transit systems across 294 Urbanized Areas (UZAs) in the US, which were stratified into six peer groups based on population. Transit efficiency and effectiveness were compared by developing a composite business efficiency index score and a composite service effectiveness index score for each urbanized area. The scores were generated using a fuzzy logic extension of the Analytical Hierarchy Process (AHP), which allows automated weighting of the measures. The NTM currently includes a limited set of performance measures, and each transit agency’s data are associated with the largest urban area it serves; consequently, it is perhaps best-suited for identifying high-performing UZAs and less suitable for identifying the weakest performers. The analytical results suggest that a few UZAs (mainly densely-populated cities and university towns) are simultaneously able to achieve high scores on both business efficiency and service effectiveness. In most small- and medium-size conurbations, business efficiency appears to be a higher policy priority than service effectiveness.

Limitations of the invertible-map equivalences

Abstract This note draws conclusions that arise by combining two recent papers, by Anuj Dawar, Erich Grädel and Wied Pakusa, published at ICALP 2019, and by Moritz Lichter, published at LICS 2021. In both papers, the main technical results rely on the combinatorial and algebraic analysis of the invertible-map equivalences ${\equiv ^{\text {IM}}_{k, Q}}$ on certain variants of Cai–Fürer–Immerman structures (CFI-structures for short). These ${\equiv ^{\text {IM}}_{k, Q}}$-equivalences, for a natural number $k$ and a set of primes $Q$, refine the well-known Weisfeiler–Leman equivalences used in algorithms for graph isomorphism. The intuition is that two graphs $G{\equiv ^{\text {IM}}_{k, Q}}H$ cannot be distinguished by iterative refinements of equivalences on $k$-tuples defined via linear operators on vector spaces over fields of characteristic $p \in Q$. In the first paper it has been shown, using considerable algebraic machinery, that for a prime $q \notin Q$, the ${\equiv ^{\text {IM}}_{k, Q}}$ equivalences are not strong enough to distinguish between non-isomorphic CFI-structures over the field $\mathbb {F}_q$. In the second paper, a similar but not identical construction for CFI-structures over the rings $\mathbb {Z}_{2^i}$ has, again by rather involved combinatorial and algebraic arguments, been shown to be indistinguishable with respect to ${\equiv ^{\text {IM}}_{k, \{2\}}}$. Together with an earlier work on rank logic, this second result suffices to separate rank logic from polynomial time. We show here that the two approaches can be unified to prove that CFI-structures over the rings $\mathbb {Z}_{2^i}$ are in fact indistinguishable with respect to ${\equiv ^{\text {IM}}_{k, {\mathbb {P}}}}$, for the set ${\mathbb {P}}$ of all primes. In particular, this implies the following two results. First, there is no fixed $k$ such that the invertible-map equivalence ${\equiv ^{\text {IM}}_{k, {\mathbb {P}}}}$ coincides with isomorphism on all finite graphs. Second, no extension of fixed-point logic by linear-algebraic operators over fields can capture polynomial time.

Ecotheological Community and the Question of Non-Human Animals Understood as Persons

Ecotheological Community and the Question of Non-Human Animals Understood as Persons