text
stringlengths 31
999
| source
stringclasses 5
values |
|---|---|
CONFIG. SYS is the primary configuration file for the DOS and OS/2 operating systems. It is a special ASCII text file that contains user-accessible setup or configuration directives evaluated by the operating system's DOS BIOS (typically residing in IBMBIO
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A deployment descriptor (DD) refers to a configuration file for an artifact that is deployed to some container/engine.
In the Java Platform, Enterprise Edition, a deployment descriptor describes how a component, module or application (such as a web application or enterprise application) should be deployed. It directs a deployment tool to deploy a module or application with specific container options, security settings and describes specific configuration requirements
|
https://huggingface.co/datasets/fmars/wiki_stem
|
fstab (after file systems table) is a system file commonly found in the directory /etc on Unix and Unix-like computer systems. In Linux, it is part of the util-linux package. The fstab file typically lists all available disk partitions and other types of file systems and data sources that may not necessarily be disk-based, and indicates how they are to be initialized or otherwise integrated into the larger file system structure
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The computer file hosts is an operating system file that maps hostnames to IP addresses. It is a plain text file. Originally a file named HOSTS
|
https://huggingface.co/datasets/fmars/wiki_stem
|
An . htaccess (hypertext access) file is a directory-level configuration file supported by several web servers, used for configuration of website-access issues, such as URL redirection, URL shortening, access control (for different web pages and files), and more. The 'dot' (period or full stop) before the file name makes it a hidden file in Unix-based environments
|
https://huggingface.co/datasets/fmars/wiki_stem
|
. htpasswd is a flat-file used to store usernames and password for basic authentication on an Apache HTTP Server. The name of the file is given in the
|
https://huggingface.co/datasets/fmars/wiki_stem
|
An INI file is a configuration file for computer software that consists of a text-based content with a structure and syntax comprising key–value pairs for properties, and sections that organize the properties. The name of these configuration files comes from the filename extension INI, for initialization, used in the MS-DOS operating system which popularized this method of software configuration. The format has become an informal standard in many contexts of configuration, but many applications on other operating systems use different file name extensions, such as conf and cfg
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The LMHOSTS (LAN Manager Hosts) file is used to enable Domain Name Resolution under Windows when other methods, such as WINS, fail. It is used in conjunction with workgroups and domains. If you are looking for a simple, general mechanism for the local specification of IP addresses for specific hostnames (server names), use the HOSTS file, not the LMHOSTS file
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Safe mode is a diagnostic mode of a computer operating system (OS). It can also refer to a mode of operation by application software. Safe mode is intended to help fix most, if not all, problems within an operating system
|
https://huggingface.co/datasets/fmars/wiki_stem
|
passwd is a command on Unix, Plan 9, Inferno, and most Unix-like operating systems used to change a user's password. The password entered by the user is run through a key derivation function to create a hashed version of the new password, which is saved. Only the hashed version is stored; the entered password is not saved for security reasons
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A . pcf file can be profile configuration file or a configuration file for setting the client parameters in a virtual private network. The file is in INI file format and contains information about a VPN connection which is necessary for the client software, such as the username, password, tunneling port, DNS settings
|
https://huggingface.co/datasets/fmars/wiki_stem
|
resolv. conf is the name of a computer file used in various operating systems to configure the system's Domain Name System (DNS) resolver. The file is a plain-text file usually created by the network administrator or by applications that manage the configuration tasks of the system
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In some FreeBSD, Linux distributions, and other Unix-like operating systems, the resolvconf program maintains the system information about the currently available name servers and manages the contents of the configuration file resolv. conf, which determines Domain Name System (DNS) resolver parameters.
Before a computer can connect to an external network resource by name, it must convert that alpha-numeric name (e
|
https://huggingface.co/datasets/fmars/wiki_stem
|
System Configuration description Language formerly known as Substation Configuration description Language (SCL) is the language and representation format specified by IEC 61850 for the configuration of electrical substation devices. This includes representation of modeled data and communication services specified by IEC 61850–7–X standard documents. The complete SCL representation and its details are specified in IEC 61850-6 standard document
|
https://huggingface.co/datasets/fmars/wiki_stem
|
TOML is a file format for configuration files. It is intended to be easy to read and write due to obvious semantics which aim to be "minimal", and is designed to map unambiguously to a dictionary. Its specification is open-source, and receives community contributions
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The configuration file XF86Config of the XFree86 project is used by the X server to set necessary configuration parameters.
It is a plain text file ordered into sections and subsections.
Important sections are Files, InputDevice, Monitor, Modes, Screen, Device, and ServerLayout
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The file xorg. conf is a file used for configuring the X. Org Server
|
https://huggingface.co/datasets/fmars/wiki_stem
|
YAML () (see § History and name) is a human-readable data-serialization language. It is commonly used for configuration files and in applications where data is being stored or transmitted. YAML targets many of the same communications applications as Extensible Markup Language (XML) but has a minimal syntax which intentionally differs from Standard Generalized Markup Language (SGML)
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A Chip description file is a file that contains a possible annotation of a microarray chip type. The file typically specifies which probes map to the same genomic unit of interest. This mapping methodology solves the problem of a reliable reconstruction of expression levels as, if more than one probeset per gene exists, expression signals for the same transcript may be enhanced incorrectly
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Comma-separated values (CSV) file is a text file format that uses a comma to separate values. Other formats with delimiter separated values, such as tab-separated values (TSV), are also sometimes casually referred to as CSV. A CSV file typically stores tabular data (numbers and text) in plain text, where each line has the same number of fields
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Formats that use delimiter-separated values (also DSV): 113 store two-dimensional arrays of data by separating the values in each row with specific delimiter characters. Most database and spreadsheet programs are able to read or save data in a delimited format. Due to their wide support, DSV files can be used in data exchange among many applications
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Tab-separated values (TSV) is a simple, text-based file format for storing tabular data. Records are separated by newlines, and values within a record are separated by tab characters. The TSV format is thus a delimiter-separated values format, similar to comma-separated values
|
https://huggingface.co/datasets/fmars/wiki_stem
|
JSON (JavaScript Object Notation, pronounced ; also ) is an open standard file format and data interchange format that uses human-readable text to store and transmit data objects consisting of attribute–value pairs and arrays (or other serializable values). It is a common data format with diverse uses in electronic data interchange, including that of web applications with servers.
JSON is a language-independent data format
|
https://huggingface.co/datasets/fmars/wiki_stem
|
JSON Feed is a Web feed file format for Web syndication in JSON instead of XML as used by RSS and Atom. A range of software libraries and web frameworks support content syndication via JSON Feed. Supporting clients include NetNewsWire, NewsBlur, ReadKit and Reeder
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The BioCompute Object (BCO) Project is a community-driven initiative to build a framework for standardizing and sharing computations and analyses generated from High-throughput sequencing (HTS -- also referred to as next-generation sequencing or massively parallel sequencing). The project has since been standardized as IEEE 2791-2020, and the project files are maintained in an open source repository. The July 22nd, 2020 edition of the Federal Register announced that the FDA now supports the use of BioCompute (officially known as IEEE 2791-2020) in regulatory submissions, and the inclusion of the standard in the Data Standards Catalog for the submission of HTS data in NDAs, ANDAs, BLAs, and INDs to CBER, CDER, and CFSAN
|
https://huggingface.co/datasets/fmars/wiki_stem
|
BSON () is a computer data interchange format. The name "BSON" is based on the term JSON and stands for "Binary JSON". It is a binary form for representing simple or complex data structures including associative arrays (also known as name-value pairs), integer indexed arrays, and a suite of fundamental scalar types
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Fast Healthcare Interoperability Resources' (FHIR, pronounced "fire") standard is a set of rules and specifications for exchanging electronic health care data. It is designed to be flexible and adaptable, so that it can be used in a wide range of settings and with different health care information systems. The goal of FHIR is to enable the seamless and secure exchange of health care information, so that patients can receive the best possible care
|
https://huggingface.co/datasets/fmars/wiki_stem
|
GeoJSON is an open standard format designed for representing simple geographical features, along with their non-spatial attributes. It is based on the JSON format.
The features include points (therefore addresses and locations), line strings (therefore streets, highways and boundaries), polygons (countries, provinces, tracts of land), and multi-part collections of these types
|
https://huggingface.co/datasets/fmars/wiki_stem
|
glTF is a standard file format for three-dimensional scenes and models. A glTF file uses one of two possible file extensions: . gltf (JSON/ASCII) or
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Hypertext Application Language (HAL) is a convention for defining hypermedia such as links to external resources within JSON or XML code. It is documented in an Internet Draft (a "work in progress"), however, the latest version of HAL Internet-Draft expired on November 12, 2016. The standard was initially proposed in June 2012 specifically for use with JSON and has since become available in two variations, JSON and XML
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Federal Signal 3T22 / 2T22 was a dual tone, mechanical outdoor warning siren made by Federal Signal Corporation (formerly Federal Sign and Signal Corporation) from 1952 through the early 1990s. It has a very recognizable design, having a ten-port rotor (chopper) on the bottom with ten cones (horns) and a 12-port one on top with twelve cones.
History
The Federal Signal 3T22 was originally designed as the 2T22 in 1952 or 1954
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Handel was the code-name for the UK's national attack warning system in the Cold War. It consisted of a small console with two microphones, lights and gauges. The reason behind this was to provide a back-up if anything failed
|
https://huggingface.co/datasets/fmars/wiki_stem
|
OpenBroadcaster is a web-based, open-source system to run community radio and television broadcast transmitters with a simple web interface.
History
The initial concept was to develop a web based radio system to run emergency messages and public service announcements for export to Africa by using a windup radio designed by Trevor Baylis.
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Re
The Severnside Sirens are a system of Civil defense sirens located along the South Severn Estuary coastline from Redcliffe Bay to Pilning, northwest of Bristol. They are activated by Avon and Somerset Police in the event of a potential incident at one of the COMAH sites located in the area, mainly in and near Avonmouth. The system was setup in 1997 following a fire at the Albright and Wilson site in 1996
|
https://huggingface.co/datasets/fmars/wiki_stem
|
An intelligent transportation system (ITS) is an advanced application which aims to provide innovative services relating to different modes of transport and traffic management and enable users to be better informed and make safer, more coordinated, and 'smarter' use of transport networks. Some of these technologies include calling for emergency services when an accident occurs, using cameras to enforce traffic laws or signs that mark speed limit changes depending on conditions.
Although ITS may refer to all modes of transport, the directive of the European Union 2010/40/EU, made on July 7, 2010, defined ITS as systems in which information and communication technologies are applied in the field of road transport, including infrastructure, vehicles and users, and in traffic management and mobility management, as well as for interfaces with other modes of transport
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Brisbane Linked Intersection Signal System or BLISS was Brisbane City Council's ITS infrastructure platform. This system incorporates large scale Traffic Signal control, a Real Time Passenger Information System (RAPID), and other infrastructure for managing and monitoring the road network for the Greater Brisbane Area.
For many years Brisbane City Council was very progressive amongst local governments in development and implementation of ITS solutions, and BLISS is one of the results of these endeavours
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Communications access for land mobiles (CALM) is an initiative by the ISO TC 204/Working Group 16 to define a set of wireless communication protocols and air interfaces for a variety of communication scenarios spanning multiple modes of communications and multiple methods of transmissions in Intelligent Transportation System (ITS). The CALM architecture is based on an IPv6 convergence layer that decouples applications from the communication infrastructure. A standardized set of air interface protocols is provided for the best use of resources available for short, medium and long-range, safety critical communications, using one or more of several media, with multipoint (mesh) transfer
|
https://huggingface.co/datasets/fmars/wiki_stem
|
DriveOhio is an initiative within the Ohio Department of Transportation that aims to organize and accelerate smart vehicle and connected vehicle projects in the State of Ohio. It offers to be the single point of contact for policy makers, agencies, researchers, and private companies to collaborate with one another on smart transportation efforts around the state.
Mission
DriveOhio's mission is to serve as Ohio's central hub for "smart mobility", which it defines as the use of technology to move people and goods from one place to another as effectively as possible
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Floating car data (FCD) in traffic engineering and management is typically timestamped geo-localization and speed data directly collected by moving vehicles, in contrast to traditional traffic data collected at a fixed location by a stationary device or observer. In a physical interpretation context, FCD provides a Lagrangian description of the vehicle movements whereas stationary devices provide an Eulerian description. The participating vehicle acts itself consequently as a moving sensor using an onboard GPS receiver or cellular phone
|
https://huggingface.co/datasets/fmars/wiki_stem
|
COMPASS, also referred to as Freeway Traffic Management System, is a system run by the Ministry of Transportation of Ontario (MTO) to monitor and manage the flow of traffic on various roads (including 400-series highways) in Ontario.
COMPASS uses pairs of in-road sensors to detect the speed and density of traffic flow. This data is fed to a central computer at the MTO Downsview office and analyzed by operators, who also view the feeds of traffic cameras placed along the highways
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A high-occupancy toll lane (or HOT lane) is a type of traffic lane or roadway that is available to high-occupancy vehicles and other exempt vehicles without charge; other vehicles are required to pay a variable fee that is adjusted in response to demand. Unlike toll roads, drivers have an option to use general purpose lanes, on which a fee is not charged. Express toll lanes, which are less common, operate along similar lines, but do not exempt high-occupancy vehicles
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The current UK Highways Agency CCTV system is called 2nd Generation CCTV. This CCTV system has been produced from a set of specification developed by the Highways Agency, to allow it to effectively monitor traffic on England motorways and trunk roads. The network currently includes over 1500 cameras operated from 7 regional control centres across England
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Intelligent speed assistance (ISA), or intelligent speed adaptation, also known as alerting, and intelligent authority, is any system that ensures that vehicle speed does not exceed a safe or legally enforced speed. In case of potential speeding, the driver can be alerted or the speed reduced automatically.
Intelligent speed assistance uses information about the road to determine local speed limits
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Intelligent Transportation Systems (ITS) Institute is a national University Transportation Center headquartered at the University of Minnesota. The ITS Institute researches activities to enhance the safety and mobility of road-based and transit-based transportation, particularly in a northern climate and in rural environments. The ITS Institute focuses on human-centered technology, such as computing, sensing, communications, and control systems
|
https://huggingface.co/datasets/fmars/wiki_stem
|
IRIS (Intelligent Roadway Information System) is an open-source Advanced Traffic Management System (ATMS) software project developed by the Minnesota Department of Transportation. It is used by transportation agencies to monitor and manage interstate and highway traffic. IRIS uses the GPL license
|
https://huggingface.co/datasets/fmars/wiki_stem
|
ITS Platform is a Danish project which will develop and test the next generation of technologies in the field of ITS equipment in the years from 2010 to 2013. ITS is the abbreviation for “intelligent transport systems”, and it covers systems and services which can contribute to make the traffic of the future safer, more efficient, and more sustainable.
Concept
ITS Platform consists of a mobile unit in a car and an ITS server
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A managed lane is a type of highway lane that is operated with a management scheme, such as lane use restrictions or variable tolling, to optimize traffic flow, vehicle throughput, or both. Definitions and goals vary among transport agencies, but managed lanes are generally implemented to achieve an improved operational condition on a highway, such as improving traffic speed and throughput, reducing air pollution, and improving safety. Types of managed lanes include high-occupancy vehicle (HOV) lanes, high-occupancy toll lanes, express toll lanes, reversible lanes, and bus lanes
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The National Roads Telecommunications Services is the fibre-optic network of communication and control that National Highways uses to monitor England's roads. Its design has allowed active traffic management, that has led to managed motorways.
History
Prior to 2005, the motorway network was controlled by the National Motorway Communication System (NMCS)
|
https://huggingface.co/datasets/fmars/wiki_stem
|
PoliScan speed is a system for traffic enforcement made by Vitronic. The measurement is based on lidar (light radar). By time-of-flight measurement, a scanning laser determines speeds and positions of all vehicles in the measurement area
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A Road Weather Information System (RWIS) comprises automatic weather stations (AWS) (often technically referred to as Environmental Sensor Stations (ESS) as they also cover non-meteorological variables) in the field, a communication system for data transfer, and central systems to collect field data from numerous ESS. These stations measure real-time atmospheric parameters, pavement conditions, water level conditions, visibility, and sometimes other variables. Central RWIS hardware and software are used to process observations from ESS to develop nowcasts or forecasts, and to display or disseminate road weather information in a format that can be easily interpreted by a manager
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Scalable Urban Traffic Control (SURTRAC) is an adaptive traffic control system developed by researchers at the Robotics Institute, Carnegie Mellon University. SURTAC dynamically optimizes the control of traffic signals to improve traffic flow for both urban grids and corridors; optimization goals include less waiting, reduced traffic congestion, shorter trips, and less pollution. The core control engine combines schedule-driven intersection control with decentralized coordination mechanisms
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Speed limits on road traffic, as used in most countries, set the legal maximum speed at which vehicles may travel on a given stretch of road. Speed limits are generally indicated on a traffic sign reflecting the maximum permitted speed, expressed as kilometres per hour (km/h) or miles per hour (mph) or both. Speed limits are commonly set by the legislative bodies of national or provincial governments and enforced by national or regional police and judicial authorities
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Sydney Coordinated Adaptive Traffic System, abbreviated SCATS, is an intelligent transportation system that manages the dynamic (on-line, real-time) timing of signal phases at traffic signals, meaning that it tries to find the best phasing (i. e. cycle times, phase splits and offsets) for a traffic situation (for individual intersections as well as for the whole network)
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A traffic camera is a video camera which observes vehicular traffic on a road. Typically, traffic cameras are put along major roads such as highways, freeways, expressways and arterial roads, and are connected by optical fibers buried alongside or under the road, with electricity provided either by mains power in urban areas, or by solar panels or other alternative power sources which provide consistent imagery without the threat of power outages.
A monitoring center receives the live video in real time, and serves as a dispatcher if there is a traffic collision, some other disruptive incident or road safety issue
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Traffic estimation and prediction systems (TrEPS) have the potential to improve traffic conditions and reduce travel delays by facilitating better utilization of available capacity. These systems exploit currently available and emerging computer, communication, and control technologies to monitor, manage, and control the transportation system. They also provide various levels of traffic information and trip advisory to system users, including many ITS service providers, so that travelers can make timely and informed travel decisions
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Traffic optimization are the methods by which time stopped in road traffic (particularly, at traffic signals) is reduced.
Need for traffic optimization
Texas Transportation Institute estimates travel delays of between 17–55 hours of delay per person per year relating to congestion on the streets. Traffic device optimization hence becomes a significant aspect of operations
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Traffic signal preemption (also called traffic signal prioritisation) is a system that allows an operator to override the normal operation of traffic lights. The most common use of these systems manipulates traffic signals in the path of an emergency vehicle, halting conflicting traffic and allowing the emergency vehicle right-of-way, thereby reducing response times and enhancing traffic safety. Signal preemption can also be used on tram, light-rail and bus rapid transit systems, to allow public transportation priority access through intersections, and by railroad systems at crossings to prevent collisions
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A radar detector is an electronic device used by motorists to detect if their speed is being monitored by police or law enforcement using a radar gun. Most radar detectors are used so the driver can reduce the car's speed before being ticketed for speeding. In general sense, only emitting technologies, like doppler RADAR, or LIDAR can be detected
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A radar detector detector (RDD) is a device used by police or law enforcement in areas where radar detectors are declared illegal.
Radar detectors are built around a superheterodyne receiver, which has a local oscillator that radiates slightly. It is therefore possible to build a radar-detector detector, which detects such emissions (usually the frequency of the radar type being detected, plus about 10 MHz for the intermediate frequency)
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Collider (sometimes referred as Collider World) is a 2013 Irish-Portuguese co-produced drama/science fiction film distributed by beActive Entertainment. The film acts as the core for a transmedia project developed for various platforms.
The world premiere was scheduled for 10 January 2014, taking place in Dublin
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematical logic, an (induced) substructure or (induced) subalgebra is a structure whose domain is a subset of that of a bigger structure, and whose functions and relations are restricted to the substructure's domain. Some examples of subalgebras are subgroups, submonoids, subrings, subfields, subalgebras of algebras over a field, or induced subgraphs. Shifting the point of view, the larger structure is called an extension or a superstructure of its substructure
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematical logic, Tarski's high school algebra problem was a question posed by Alfred Tarski. It asks whether there are identities involving addition, multiplication, and exponentiation over the positive integers that cannot be proved using eleven axioms about these operations that are taught in high-school-level mathematics. The question was solved in 1980 by Alex Wilkie, who showed that such unprovable identities do exist
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In universal algebra and mathematical logic, a term algebra is a freely generated algebraic structure over a given signature. For example, in a signature consisting of a single binary operation, the term algebra over a set X of variables is exactly the free magma generated by X. Other synonyms for the notion include absolutely free algebra and anarchic algebra
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In universal algebra and lattice theory, a tolerance relation on an algebraic structure is a reflexive symmetric relation that is compatible with all operations of the structure. Thus a tolerance is like a congruence, except that the assumption of transitivity is dropped. On a set, an algebraic structure with empty family of operations, tolerance relations are simply reflexive symmetric relations
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The ultraproduct is a mathematical construction that appears mainly in abstract algebra and mathematical logic, in particular in model theory and set theory. An ultraproduct is a quotient of the direct product of a family of structures. All factors need to have the same signature
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In universal algebra, a variety of algebras or equational class is the class of all algebraic structures of a given signature satisfying a given set of identities. For example, the groups form a variety of algebras, as do the abelian groups, the rings, the monoids etc. According to Birkhoff's theorem, a class of algebraic structures of the same signature is a variety if and only if it is closed under the taking of homomorphic images, subalgebras, and (direct) products
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematical logic, the Barwise compactness theorem, named after Jon Barwise, is a generalization of the usual compactness theorem for first-order logic to a certain class of infinitary languages. It was stated and proved by Barwise in 1967.
Statement
Let
A
{\displaystyle A}
be a countable admissible set
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In descriptive set theory, the Borel determinacy theorem states that any Gale–Stewart game whose payoff set is a Borel set is determined, meaning that one of the two players will have a winning strategy for the game. A Gale-Stewart game is a possibly infinite two-player game, where both players have perfect information and no randomness is involved.
The theorem is a far reaching generalization of Zermelo's Theorem about the determinacy of finite games
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed point theorem for partially ordered sets. It states that if X is a non-empty chain complete poset, and
f
:
X
→
X
{\displaystyle f:X\to X}
such that
f
(
x
)
≥
x
{\displaystyle f(x)\geq x}
for all
x
,
{\displaystyle x,}
then f has a fixed point. Such a function f is called inflationary or progressive
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In order theory and model theory, branches of mathematics, Cantor's isomorphism theorem states that every two countable dense unbounded linear orders are order-isomorphic. For instance, Minkowski's question-mark function produces an isomorphism (a one-to-one order-preserving correspondence) between the numerical ordering of the rational numbers and the numerical ordering of the dyadic rationals.
The theorem is named after Georg Cantor, who first published it in 1895, using it to characterize the (uncountable) ordering on the real numbers
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematical logic, a theory is categorical if it has exactly one model (up to isomorphism). Such a theory can be viewed as defining its model, uniquely characterizing the model's structure.
In first-order logic, only theories with a finite model can be categorical
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In lambda calculus, the Church–Rosser theorem states that, when applying reduction rules to terms, the ordering in which the reductions are chosen does not make a difference to the eventual result.
More precisely, if there are two distinct reductions or sequences of reductions that can be applied to the same term, then there exists a term that is reachable from both results, by applying (possibly empty) sequences of additional reductions. The theorem was proved in 1936 by Alonzo Church and J
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Codd's theorem states that relational algebra and the domain-independent relational calculus queries, two well-known foundational query languages for the relational model, are precisely equivalent in expressive power. That is, a database query can be formulated in one language if and only if it can be expressed in the other.
The theorem is named after Edgar F
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematical logic, the compactness theorem states that a set of first-order sentences has a model if and only if every finite subset of it has a model. This theorem is an important tool in model theory, as it provides a useful (but generally not effective) method for constructing models of any set of sentences that is finitely consistent.
The compactness theorem for the propositional calculus is a consequence of Tychonoff's theorem (which says that the product of compact spaces is compact) applied to compact Stone spaces, hence the theorem's name
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In sequent calculus, the completeness of atomic initial sequents states that initial sequents A ⊢ A (where A is an arbitrary formula) can be derived from only atomic initial sequents p ⊢ p (where p is an atomic formula). This theorem plays a role analogous to eta expansion in lambda calculus, and dual to cut-elimination and beta reduction. Typically it can be established by induction on the structure of A, much more easily than cut-elimination
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The cut-elimination theorem (or Gentzen's Hauptsatz) is the central result establishing the significance of the sequent calculus. It was originally proved by Gerhard Gentzen in his landmark 1934 paper "Investigations in Logical Deduction" for the systems LJ and LK formalising intuitionistic and classical logic respectively. The cut-elimination theorem states that any judgement that possesses a proof in the sequent calculus making use of the cut rule also possesses a cut-free proof, that is, a proof that does not make use of the cut rule
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematical logic, a deduction theorem is a metatheorem that justifies doing conditional proofs from a hypothesis in systems that do not explicitly axiomatize that hypothesis, i. e. to prove an implication A → B, it is sufficient to assume A as an hypothesis and then proceed to derive B
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematical logic, a theory can be extended with
new constants or function names under certain conditions with assurance that the extension will introduce
no contradiction. Extension by definitions is perhaps the best-known approach, but it requires
unique existence of an object with the desired property. Addition of new names can also be done
safely without uniqueness
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In metalogic and metamathematics, Frege's theorem is a metatheorem that states that the Peano axioms of arithmetic can be derived in second-order logic from Hume's principle. It was first proven, informally, by Gottlob Frege in his 1884 Die Grundlagen der Arithmetik (The Foundations of Arithmetic) and proven more formally in his 1893 Grundgesetze der Arithmetik I (Basic Laws of Arithmetic I). The theorem was re-discovered by Crispin Wright in the early 1980s and has since been the focus of significant work
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematics, Gödel's speed-up theorem, proved by Gödel (1936), shows that there are theorems whose proofs can be drastically shortened by working in more powerful axiomatic systems.
Kurt Gödel showed how to find explicit examples of statements in formal systems that are provable in that system but whose shortest proof is unimaginably long. For example, the statement:
"This statement cannot be proved in Peano arithmetic in fewer than a googolplex symbols"is provable in Peano arithmetic (PA) but the shortest proof has at least a googolplex symbols, by an argument similar to the proof of Gödel's first incompleteness theorem: If PA is consistent, then it cannot prove the statement in fewer than a googolplex symbols, because the existence of such a proof would itself be a theorem of PA, a contradiction
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Gödel's completeness theorem is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first-order logic.
The completeness theorem applies to any first-order theory: If T is such a theory, and φ is a sentence (in the same language) and every model of T is a model of φ, then there is a (first-order) proof of φ using the statements of T as axioms. One sometimes says this as "anything universally true is provable"
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Gödel's incompleteness theorems are two theorems of mathematical logic that are concerned with the limits of provability in formal axiomatic theories. These results, published by Kurt Gödel in 1931, are important both in mathematical logic and in the philosophy of mathematics. The theorems are widely, but not universally, interpreted as showing that Hilbert's program to find a complete and consistent set of axioms for all mathematics is impossible
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematics, the Halpern–Läuchli theorem is a partition result about finite products of infinite trees. Its original purpose was to give a model for set theory in which the Boolean prime ideal theorem is true but the axiom of choice is false. It is often called the Halpern–Läuchli theorem, but the proper attribution for the theorem as it is formulated below is to Halpern–Läuchli–Laver–Pincus or HLLP (named after James D
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Herbrand's theorem is a fundamental result of mathematical logic obtained by Jacques Herbrand (1930). It essentially allows a certain kind of reduction of first-order logic to propositional logic. Although Herbrand originally proved his theorem for arbitrary formulas of first-order logic, the simpler version shown here, restricted to formulas in prenex form containing only existential quantifiers, became more popular
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematical logic, the Kanamori–McAloon theorem, due to Kanamori & McAloon (1987), gives an example of an incompleteness in Peano arithmetic, similar to that of the Paris–Harrington theorem. They showed that a certain finitistic theorem in Ramsey theory is not provable in Peano arithmetic (PA).
Statement
Given a set
s
⊆
N
{\displaystyle s\subseteq \mathbb {N} }
of non-negative integers, let
min
(
s
)
{\displaystyle \min(s)}
denote the minimum element of
s
{\displaystyle s}
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938 and appear in his 1952 book Introduction to Metamathematics. A related theorem, which constructs fixed points of a computable function, is known as Rogers's theorem and is due to Hartley Rogers, Jr
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following:
Let (L, ≤) be a complete lattice and let f : L → L be an monotonic function (w. r. t
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematical logic, the Paris–Harrington theorem states that a certain combinatorial principle in Ramsey theory, namely the strengthened finite Ramsey theorem, which is expressible in Peano arithmetic, is not provable in this system. The combinatorial principle is however provable in slightly stronger systems.
This result has been described by some (such as the editor of the Handbook of Mathematical Logic in the references below) as the first "natural" example of a true statement about the integers that could be stated in the language of arithmetic, but not proved in Peano arithmetic; it was already known that such statements existed by Gödel's first incompleteness theorem
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In computability theory Post's theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees.
Background
The statement of Post's theorem uses several concepts relating to definability and recursion theory. This section gives a brief overview of these concepts, which are covered in depth in their respective articles
|
https://huggingface.co/datasets/fmars/wiki_stem
|
The Cantor–Bernstein–Schroeder theorem of set theory has a counterpart for measurable spaces, sometimes called the Borel Schroeder–Bernstein theorem, since measurable spaces are also called Borel spaces. This theorem, whose proof is quite easy, is instrumental when proving that two measurable spaces are isomorphic. The general theory of standard Borel spaces contains very strong results about isomorphic measurable spaces, see Kuratowski's theorem
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematics, Tarski's theorem, proved by Alfred Tarski (1924), states that in ZF the theorem "For every infinite set
A
{\displaystyle A}
, there is a bijective map between the sets
A
{\displaystyle A}
and
A
×
A
{\displaystyle A\times A}
" implies the axiom of choice. The opposite direction was already known, thus the theorem and axiom of choice are equivalent.
Tarski told Jan Mycielski (2006) that when he tried to publish the theorem in Comptes Rendus de l'Académie des Sciences de Paris, Fréchet and Lebesgue refused to present it
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics. Informally, the theorem states that "arithmetical truth cannot be defined in arithmetic". The theorem applies more generally to any sufficiently strong formal system, showing that truth in the standard model of the system cannot be defined within the system
|
https://huggingface.co/datasets/fmars/wiki_stem
|
In mathematics, the well-ordering theorem, also known as Zermelo's theorem, states that every set can be well-ordered. A set X is well-ordered by a strict total order if every non-empty subset of X has a least element under the ordering. The well-ordering theorem together with Zorn's lemma are the most important mathematical statements that are equivalent to the axiom of choice (often called AC, see also Axiom of choice § Equivalents)
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Mustafa Tamer Başar (born January 19, 1946) is a control and game theorist who is the Swanlund Endowed Chair and Center for Advanced Study Professor of Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign, USA. He is also the Director of the Center for Advanced Study (since 2014).
Education
Tamer Başar received a B
|
https://huggingface.co/datasets/fmars/wiki_stem
|
DocBook is a semantic markup language for technical documentation. It was originally intended for writing technical documents related to computer hardware and software, but it can be used for any other sort of documentation. As a semantic language, DocBook enables its users to create document content in a presentation-neutral form that captures the logical structure of the content; that content can then be published in a variety of formats, including HTML, XHTML, EPUB, PDF, man pages, WebHelp and HTML Help, without requiring users to make any changes to the source
|
https://huggingface.co/datasets/fmars/wiki_stem
|
DokuWiki is an open source wiki application licensed under GPLv2 and written in the PHP programming language. It works on plain text files and thus does not need a database. Its syntax is similar to the one used by MediaWiki
|
https://huggingface.co/datasets/fmars/wiki_stem
|
GIMP ( GHIMP; GNU Image Manipulation Program) is a free and open-source raster graphics editor used for image manipulation (retouching) and image editing, free-form drawing, transcoding between different image file formats, and more specialized tasks. It is not designed to be used for drawing, though some artists and creators have used it in this way. GIMP is released under the GPL-3
|
https://huggingface.co/datasets/fmars/wiki_stem
|
A Help Authoring Tool or HAT is a software program used by technical writers to create online help systems.
Functions
The basic functions of a Help Authoring Tool (HAT) can be divided into the following categories:
File input
HATs obtain their source text either by importing it from a file produced by another program, or by allowing the author to create the text within the tool by using an editor. File formats that can be imported vary from HAT to HAT
|
https://huggingface.co/datasets/fmars/wiki_stem
|
HelpSmith is a Windows-based help authoring tool published by Divcom Software. HelpSmith allows a technical writer to create documentation in various formats, such as HTML Help (CHM), Web Help (HTML-based help system), PDF, and ePub. Also HelpSmith includes screen capture and image annotation tools
|
https://huggingface.co/datasets/fmars/wiki_stem
|
An interactive electronic technical manual (IETM) is a portal to manage technical documentation. IETMs compress volumes of text into just CD-ROMs or online pages which may include sound and video, and allow readers to locate needed information far more rapidly than in paper manuals. IETMs came into widespread use in the 1990s as huge technical documentation projects for the aircraft and defense industries
|
https://huggingface.co/datasets/fmars/wiki_stem
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.