Search

Objective: To assess whether implementing the freeware version of the SCORE EEG system (Standardized Computer-based Organized Reporting of EEG) leads to improvement in the quality of clinical EEG reading, and whether EEG reports in SCORE EEG are understood and accepted by the referring physicians. Methods: We generated EEG reports in the conventional, free-text style and then using SCORE EEG, in consecutive patients referred to routine EEG. We used the Georgian translation in the SCORE EEG Free Edition. We pre-defined quality indicators consisting of a list of 24 key features that need to be addressed in EEG reports. We compared these quality indicators in free-text reports with SCORE EEG. In addition, EEG reports in SCORE EEG format were assessed by ten referring physicians, who evaluated their usability on a 7-point Likert scale. Results: We included and evaluated EEG reports from 157 patients (80 female; age: 1–75 years; median: 28 years). Fourteen features were reported exclusively in SCORE EEG, four were reported significantly more often in SCORE EEG than in free-text format, and six features were reported equally often in SCORE EEG and in free-text format. Usability aspects of SCORE EEG were highly rated by the referring physicians (median 6–7 on the 7-point Likert scale). Conclusions: The structured system of EEG reporting in SCORE EEG helped the experts reading clinical EEG to cover the important aspects and increase the quality of clinical EEG reports. Significance: Implementing the freeware version of SCORE EEG in underprivileged areas will help improving management of patients with epilepsy.

Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an algorithmic solution. Various complexity constraints on such solutions induce various versions of clarithmetic. The present paper introduces a parameterized/schematic version CLA11(P1,P2,P3,P4). By tuning the three parameters P1,P2,P3 in an essentially mechanical manner, one automatically obtains sound and complete theories with respect to a wide range of target tricomplexity classes, i.e. combinations of time (set by P3), space (set by P2) and so called amplitude (set by P1) complexities. Sound in the sense that every theorem T of the system represents an interactive number-theoretic computational problem with a solution from the given tricomplexity class and, furthermore, such a solution can be automatically extracted from a proof of T. And complete in the sense that every interactive number-theoretic problem with a solution from the given tricomplexity class is represented by some theorem of the system. Furthermore, through tuning the 4th parameter P4, at the cost of sacrificing recursive axiomatizability but not simplicity or elegance, the above extensional completeness can be strengthened to intensional completeness, according to which every formula representing a problem with a solution from the given tricomplexity class is a theorem of the system. This article is published in two parts. The present Part I introduces the system and proves its completeness, while Part II is devoted to proving soundness.

During the fieldworks conducted within the CaBOL project in 2020–2023, 14 new species of Heteroptera belonging to seven families, and a new species of Auchenorrhyncha were collected in Georgia for the first time: Trypetimorpha occidentalis Huang & Bourgoin, 1993 (Tropiduchidae), Dimorphopterus blissoides (Baerensprung, 1859) (Blissidae), Europiella decolor (Uhler, 1893), Tuponia mixticolor (A. Costa, 1862), Deraeocoris ventralis Reuter, 1904, Orthocephalus brevis (Panzer, 1798) (Miridae), Alloeorhynchus flavipes (Fieber, 1836) (Nabidae), Holcogaster fibulata (Germar, 1831), Vilpianus galii Wolff, 1802 (Pentatomidae), Holotrichius bergrothi Reuter, 1891, Reduvius ciliatus Jakovlev, 1879, Oncocephalus squalidus (Rossi, 1790) (Reduviidae), Pterotmetus staphyliniformis (Germar, 1831), Diomphalus hispidulus Fieber, 1864 (Rhyparochromidae), and Psacasta neglecta (Herrich-Schäffer, 1837) (Scutellaridae). The present study provides distributional, genetic, and collecting information on the newly recorded species followed by remarks.

Computability logic (see http://www.csc.villanova.edu/~japaridz/CL/) is a long-term project for redeveloping logic on the basis of a constructive game semantics, with games seen as abstract models of interactive computational problems. Among the fragments of this logic successfully axiomatized so far is CL12 --- a conservative extension of classical first-order logic, whose language augments that of classical logic with the so called choice sorts of quantifiers and connectives. This system has already found fruitful applications as a logical basis for constructive and complexity-oriented versions of Peano arithmetic, such as arithmetics for polynomial time computability, polynomial space computability, and beyond. The present paper introduces a third, indispensable complexity measure for interactive computations termed amplitude complexity, and establishes the adequacy of CL12 with respect to A-amplitude, S-space and T-time computability under certain minimal conditions on the triples (A,S,T) of function classes. This result very substantially broadens the potential application areas of CL12. The paper is self-contained, and targets readers with no prior familiarity with the subject.

The present study aims to provide an updated checklist of the owlfly subfamily Ascalaphidae Lefèbvre, 1842, with the first records of the genus Deleproctophylla Lefèbvre, 1842, from the country. The new records give an improved understanding of owlfly distribution within the country. The record of the genus Deleproctophylla in Georgia is based on a single female specimen of D. australis (Fabricius, 1787).

The present article introduces ptarithmetic (short for “polynomial time arithmetic”) — a formal number theory similar to the well known Peano arithmetic, but based on the recently born computability logic instead of classical logic. The formulas of ptarithmetic represent interactive computational problems rather than just true/false statements, and their “truth” is understood as existence of a polynomial time solution. The system of ptarithmetic elaborated in this article is shown to be sound and complete. Sound in the sense that every theorem T of the system represents an interactive number-theoretic computational problem with a polynomial time solution and, furthermore, such a solution can be effectively extracted from a proof of T . And complete in the sense that every interactive number-theoretic problem with a polynomial time solution is represented by some theorem T of the system. The paper is self-contained, and can be read without any prior familiarity with computability logic.

Computability logic (CoL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently introduced semantical platform and ambitious program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. Its expressions represent interactive computational tasks seen as games played by a machine against the environment, and "truth" is understood as existence of an algorithmic winning strategy. With logical operators standing for operations on games, the formalism of CoL is open-ended, and has already undergone series of extensions. This article extends the expressive power of CoL in a qualitatively new way, generalizing formulas (to which the earlier languages of CoL were limited) to circuit-style structures termed cirquents. The latter, unlike formulas, are able to account for subgame/subtask sharing between different parts of the overall game/task. Among the many advantages offered by this ability is that it allows us to capture, refine and generalize the well known independence-friendly logic which, after the present leap forward, naturally becomes a conservative fragment of CoL, just as classical logic had been known to be a conservative fragment of the formula-based version of CoL. Technically, this paper is self-contained, and can be read without any prior familiarity with CoL.

The fossorial sand cockroach Hemelytroblatta livida (Brunner von Wattenwyl, 1865) is reported from Georgia for the first time, with a commentary on the species composition of the Corydiinae Saussure, 1864 subfamily in the Caucasus. Collection data, pictures of the male and female, and DNA barcodes are also provided. Furthermore, information on Polyphaga aegyptiaca (Linnaeus, 1758) is provided, along with images of the male, female, and juvenile.

The widespread Mediterranean cricket, Arachnocephalus vestitus (Orthoptera: Mogoplistidae), is hereby reported as a new record for Georgia. In total, four females have been examined in 2020 and 2021, of which three specimens have been collected, and the information on the fourth one is based on photographic evidence. Cytochrom oxydase I (COI) barcoding further validates our finding.