(Q).
Information:  - Frank Biela (born 2 August 1964 in Neuss) is an auto racing driver, mainly competing in touring cars and sportscar racing. He has raced exclusively in cars manufactured by the Audi marque since 1990.  - The 24 Hours of Daytona, currently known as the Rolex 24 At Daytona for sponsorship reasons, is a 24-hour sports car endurance race held annually at Daytona International Speedway in Daytona Beach, Florida. It is run on a combined road course, utilizing portions of the NASCAR tri-oval and an infield road course. Since its inception, it has been held the last weekend of January or first weekend of February, part of Speedweeks, and it is the first major automobile race of the year in the United States. It is also the first race of the season for the WeatherTech SportsCar Championship.  - Didier Theys (born 19 October 1956) is a Belgian sports car driver. He is a two-time overall winner of the 24 Hours of Daytona (1998 and 2002); a winner of the 12 Hours of Sebring (1998); the Sports Racing Prototype driver champion of the Grand-American Road Racing Association (2002) and the winner of the 24 Hours of Spa (1987 in a factory BMW). He was also the polesitter (1996) and a podium finisher at the 24 Hours of Le Mans (1997, 1998 and 1999). The podium finish in 1999 was a third overall in the factory Audi R8R with co-drivers Emanuele Pirro and Frank Biela. Theys first appearance at Le Mans was in 1982, while his last start in the worlds most famous endurance sports car race came 20 years later in 2002.  - The 24 Hours of Le Mans is the world's oldest active sports car race in endurance racing, held annually since near the town of Le Mans, France. It is one of the most prestigious automobile races in the world and is often called the "Grand Prix of Endurance and Efficiency". The event represents one leg of the Triple Crown of Motorsport; other events being the Indianapolis 500, and the Monaco Grand Prix.  - Emanuele Pirro (born 12 January 1962, in Rome, Italy) is an Italian former Formula One driver and five time Le Mans 24-hour winner.  - The 1987 American Racing Series Championship consisted of 10 races . Didier Theys won three races on his way to the championship .  - The 12 Hours of Sebring is an annual motorsport endurance race for sports cars held at Sebring International Raceway, on the site of the former Hendricks Army Airfield World War II air base in Sebring, Florida. The event is the second round of the United SportsCar Championship and in the past has been a round of the now defunct World Sportscar Championship, IMSA GT Championship and American Le Mans Series. In 2012, the race was the opening event of the FIA World Endurance Championship.    Given the information above, choose from the list below the object entity that exhibits the relation 'sport' with the subject '1987 american racing series season'.  Choices: - auto racing  - formula one  - motorsport  - nascar
(A).
auto racing


(Q).
Information:  - Mathematics (from Greek  "máthma", knowledge, study, learning) is the study of topics such as quantity (numbers), structure, space, and change. There is a range of views among mathematicians and philosophers as to the exact scope and definition of mathematics.  - Computer science is the study of the theory, experimentation, and engineering that form the basis for the design and use of computers. It is the scientific and practical approach to computation and its applications and the systematic study of the feasibility, structure, expression, and mechanization of the methodical procedures (or algorithms) that underlie the acquisition, representation, processing, storage, communication of, and access to information. An alternate, more succinct definition of computer science is the study of automating algorithmic processes that scale. A computer scientist specializes in the theory of computation and the design of computational systems.  - Set theory is a branch of mathematical logic that studies sets, which informally are collections of objects. Although any type of object can be collected into a set, set theory is applied most often to objects that are relevant to mathematics. The language of set theory can be used in the definitions of nearly all mathematical objects.  - The Calculus of Constructions ( CoC ) is a type theory created by Thierry Coquand . It can serve as both a typed programming language and as constructive foundation for mathematics . For this second reason , the CoC and its variants have been the basis for Coq and other proof assistants . Some of its variants include the calculus of inductive constructions ( which adds inductive types ) , the calculus of ( co ) inductive constructions ( which adds coinduction ) , and the predicative calculus of inductive constructions ( which removes some impredicativity ) .  - In mathematics, logic, and computer science, a type theory is any of a class of formal systems, some of which can serve as alternatives to set theory as a foundation for all mathematics. In type theory, every "term" has a "type" and operations are restricted to terms of a certain type.  - In computer science, Coq is an interactive theorem prover. It allows the expression of mathematical assertions, mechanically checks proofs of these assertions, helps to find formal proofs, and extracts a certified program from the constructive proof of its formal specification. Coq works within the theory of the calculus of inductive constructions, a derivative of the calculus of constructions. Coq is not an automated theorem prover but includes automatic theorem proving tactics and various decision procedures.  - A formal proof or derivation is a finite sequence of sentences (called well-formed formulas in the case of a formal language), each of which is an axiom, an assumption, or follows from the preceding sentences in the sequence by a rule of inference. The last sentence in the sequence is a theorem of a formal system. The notion of theorem is not in general effective, therefore there may be no method by which we can always find a proof of a given sentence or determine that none exists. The concept of natural deduction is a generalization of the concept of proof.  - In mathematics, a constructive proof is a method of proof that demonstrates the existence of a mathematical object by creating or providing a method for creating the object. This is in contrast to a non-constructive proof (also known as an "existence proof" or "pure existence theorem") which proves the existence of a particular kind of object without providing an example.  - A formal system or logical calculus is any well-defined system of abstract thought based on the model of mathematics. A formal system need not be mathematical as such; for example, Spinoza's "Ethics" imitates the form of Euclid's "Elements".. Spinoza employed Euclidiean elements such as "axioms" or "primitive truths", rules of inferences etc. so that a calculus can be build using these. For nature of such primitive truths, one can consult Tarski's "Concept of truth for a formalized language".   - In computer science and mathematical logic, a proof assistant or interactive theorem prover is a software tool to assist with the development of formal proofs by human-machine collaboration. This involves some sort of interactive proof editor, or other interface, with which a human can guide the search for proofs, the details of which are stored in, and some steps provided by, a computer.    Given the information above, choose from the list below the object entity that exhibits the relation 'instance of' with the subject 'calculus of constructions'.  Choices: - branch  - class  - communication  - computer  - concept  - design  - formal system  - information  - language  - mathematical object  - mathematics  - method  - object  - programming  - programming language  - quantity  - reason  - scale  - science  - set theory  - structure  - study  - theory  - truth
(A).
formal system