Downloads & Free Reading Options - Results

All the insane-sounding collages of \"Bob\" Dobbs bulldada come from the great Fernandinande LeMur. Some ranting about the War on God is by Stang and Einstein's Secret Orchestra in the Pufferdome at Starwood Festival of 2000. A Puzzling Evidence clip with Dr. Hal talking about the hot link of X-Day is even older, the 1980s, and we hear Nenslo's great song \"There's a Feller Down in Texas\", recorded at a big devival in the 1990s. All the rest is a chat with Lonesome Cowboy Dave, covering everything and nothing.

All the insane-sounding collages of \"Bob\" Dobbs bulldada come from the great Fernandinande LeMur. Some ranting about the War on God is by Stang and Einstein's Secret Orchestra in the Pufferdome at Starwood Festival of 2000. A Puzzling Evidence clip with Dr. Hal talking about the hot link of X-Day is even older, the 1980s, and we hear Nenslo's great song \"There's a Feller Down in Texas\", recorded at a big devival in the 1990s. All the rest is a chat with Lonesome Cowboy Dave, covering everything and nothing.

This column will be provided each quarter as a source for reliability, radiation results, NASA capabilities, and other information on programmable logic devices and related applications. This quarter's column will include some announcements and some recent radiation test results and evaluations of interest. Specifically, the following topics will be covered: the Military and Aerospace Applications of Programmable Devices and Technologies Conference to be held at GSFC in September, 1998, proton test results, and some total dose results.

TRI 2 2018/2019

The relationships between redundant logic and don't care conditions in combinational circuits are well known. Redundancies in a combinational circuit can be explicitly identified using test generation algorithms or implicitly eliminated by specifying don't cares for each gate in the combinational network and minimizing the gates, subject to the don't care conditions. In this paper, we explore the relationships between redundant logic and don't care conditions in sequential circuits. Stuck-at faults in a sequential circuit may be testable in the combinational sense, but may be redundant because they do not alter the terminal behavior of anon-scan sequential machine. The sequential redundancies result in a faulty State Transition Graph (STG) that is equivalent to the STG of the true machine. We present a classification of redundant faults in sequential circuits composed of single or interacting finite state machines.

This article describes the system ProofWeb developed for teaching logic to undergraduate computer science students. The system is based on the higher order proof assistant Coq, and is made available to the students through an interactive web interface. Part of this system is a large database of logic problems. This database will also hold the solutions of the students. The students do not need to install anything to be able to use the system (not even a browser plug-in), and the teachers are able to centrally track progress of the students. The system makes the full power of Coq available to the students, but simultaneously presents the logic problems in a way that is customary in undergraduate logic courses. Both styles of presenting natural deduction proofs (Gentzen-style "tree view" and Fitch-style "box view") are supported. Part of the system is a parser that indicates whether the students used the automation of Coq to solve their problems or that they solved it themselves using only the inference rules of the logic. For these inference rules dedicated tactics for Coq have been developed. The system has already been used in type theory courses and logic undergraduate courses. The ProofWeb system can be tried at http://proofweb.cs.ru.nl/.

digita-logic dumped with WikiTeam tools.

Artificial intelligence (AI) ideas and techniques are critical to the development of intelligent information systems that will be used to collect, manipulate, and retrieve the vast amounts of space data produced by 'Missions to Planet Earth.' Natural language processing, inference, and expert systems are at the core of this space application of AI. This paper presents logic programming as an AI tool that can support inference (the ability to draw conclusions from a set of complicated and interrelated facts). It reports on the use of logic programming in the study of metadata specifications for a small problem domain of airborne sensors, and the dataset characteristics and pointers that are needed for data access.

We present a nanomechanical device, operating as a reprogrammable logic gate, and performing fundamental logic functions such as AND/OR and NAND/NOR. The logic function can be programmed (e.g., from AND to OR) dynamically, by adjusting the resonator's operating parameters. The device can access one of two stable steady states, according to a specific logic function this operation is mediated by the noise floor which can be directly adjusted, or dynamically tuned via an adjustment of the underlying nonlinearity of the resonator, i.e., it is not necessary to have direct control over the noise floor. The demonstration of this reprogrammable nanomechanical logic gate affords a path to the practical realization of a new generation of mechanical computers.

In recent years, Graphplan style reachability analysis and mutual exclusion reasoning have been used in many high performance planning systems. While numerous refinements and extensions have been developed, the basic plan graph structure and reasoning mechanisms used in these systems are tied to the very simple STRIPS model of action. In 1999, Smith and Weld generalized the Graphplan methods for reachability and mutex reasoning to allow actions to have differing durations. However, the representation of actions still has some severe limitations that prevent the use of these techniques for many real-world planning systems. In this paper, we 1) separate the logic of reachability from the particular representation and inference methods used in Graphplan, and 2) extend the notions of reachability and mutual exclusion to more general notions of time and action. As it turns out, the general rules for mutual exclusion reasoning take on a remarkably clean and simple form. However, practical instantiations of them turn out to be messy, and require that we make representation and reasoning choices.

In recent years, Graphplan style reachability analysis and mutual exclusion reasoning have been used in many high performance planning systems. While numerous refinements and extensions have been developed, the basic plan graph structure and reasoning mechanisms used in these systems are tied to the very simple STRIPS model of action. In 1999, Smith and Weld generalized the Graphplan methods for reachability and mutex reasoning to allow actions to have differing durations. However, the representation of actions still has some severe limitations that prevent the use of these techniques for many real-world planning systems. In this paper, we 1) separate the logic of reachability from the particular representation and inference methods used in Graphplan, and 2) extend the notions of reachability and mutual exclusion to more general notions of time and action. As it turns out, the general rules for mutual exclusion reasoning take on a remarkably clean and simple form. However, practical instantiations of them turn out to be messy, and require that we make representation and reasoning choices.

The Journal of Logic Programming 1992: Volume 13 , Issue CONTENTS. Digitized from IA1652909-07 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1992_13_index . Next issue: sim_journal-of-logic-and-algebraic-programming_1992-05_13_1 .

VEGAN LOGIC - EXPERIMENTAL / ALTERNATIVE MUSİC FROM TODAY'S RUSSIA  (LIVE ON 94.9 FM AÇIK RADYO)

The main target of this paper is to control the speed of DC motor by comparing the actual and the desired speed set point. The DC motor is designed using Fuzzy logic and MPC controllers. The comparison is made between the proposed controllers for the control target speed of the DC motor using square and white noise desired input signals with the help of Matlab/Simulink software. It has been realized that the design based on the fuzzy logic controller track the set pointwith the best steady state and transient system behavior than the design with MPC controller. Finally, the comparative simulation result prove the effectiveness of the DC motor with fuzzy logic controller.

We present a program synthesis method based on unfold/fold transformation rules which can be used for deriving terminating definite logic programs from formulas of the Weak Monadic Second Order theory of one successor (WS1S). This synthesis method can also be used as a proof method which is a decision procedure for closed formulas of WS1S. We apply our synthesis method for translating CLP(WS1S) programs into logic programs and we use it also as a proof method for verifying safety properties of infinite state systems.

Mathematical physics equations, introduction to mathematical logic and physics, astrophysics, cosmic physics research

This week Greg sat down with Dr. Frank Turek. Frank is a best selling author, apologist, radio host, and Founder & President of CrossExamined.org. They discussed the foundation of logic, why apologetics are important to the average christian, what the most insane argument Frank has ever heard from an atheist, and how the secular worldview just doesn't hold up. Frank also sat in for a segment of Fresh 10 with Greg. You'll never believe question five! Enjoy! Jacob's Supply QUALITY BUILDING PRODUCTS AT WHOLESALE PRICING!Facebook: Dead Men Walking PodcastYoutube: Dead Men Walking PodcastInstagram: @DeadMenWalkingPodcastTwitter X: @RealDMWPodcastExclusive Content: PubTV AppSupport the showFacebook Page: Dead Men Walking PodcastInstagram: @deadmenwalkingpodcastThreads: @deadmenwalkingpodcastTwitter: @RealDMWPodcastCheck out our snarky merch HERE

The general aim of this study is to gain more insight into Iranian people’s conceptualization of "Aberu”, a culture-specific honor concept in Iran. By providing participants with various characteristics that are based on an earlier study, we now want to explore how important these characteristics are to Aberu from the participants’ perspective as well as from what the participants think is the perspective of the society (H1). We will examine possible group differences (i.e., male vs. female, attitudes towards Aberu in society, personal endorsements of Aberu) in discrepancies participants report how characteristics are important to the concept of Aberu from their personal and the societal view (H2, 3, 4). Moreover, we will explore the meaning of these discrepancies by exploring associations with individuals' age (H5), levels of cultural mismatch (H6), levels of tightness-looseness (H7), religiosity (H8), subjective well-being (H9).

This paper is in the public domain in USA. Metadata comes from the CrossRef API, see full record in the source URL below.

This item represents a case in PACER, the U.S. Government's website for federal case data. This information is uploaded quarterly. To see our most recent version please use the source url parameter, linked below. To see the canonical source for this data, please consult PACER directly.

An existing telemetry scheme employs Bipolar Return-to-Zero (BPRZ) logic to encode binary information. The BPRZ provides for trilevel waveform pulse code modulation; however, the current implementation does not use the full capacity of the BPRZ logic. Sign Polar Return-to-Zero encoding exploits the remaining encoding capacity to provide an additional bit transfer per channel word. This implementation transfers the word argument sign information by the polarity encoding of the first nonzero pulse in each telemetry word pulse encoded waveform. Significant increase in data transfer efficiency is provided in this technique.

Journal of Philosophical Logic 1991: Volume 20 , Issue CONTENTS. Digitized from IA1513835-02 . Previous issue: sim_journal-of-philosophical-logic_1990-11_19_4 . Next issue: sim_journal-of-philosophical-logic_1991-02_20_1 .

Journal of Philosophical Logic 1991: Volume 20 , Issue CONTENTS. Digitized from IA1513835-02 . Previous issue: sim_journal-of-philosophical-logic_1990-11_19_4 . Next issue: sim_journal-of-philosophical-logic_1991-02_20_1 .

Pope Francis attacked our God Given Right to Defend Ourselves, our Homes and our Countries. He called the pursuit of Security and Self Preservation by Individuals and Nations through the possession of weapons: "Perverse Logic". Unfortunately for Jorge - that Bishop Dressed in White - JESUS CHRIST Himself extolled and indeed Personified this "Perverse Logic"! Who is right Francis or The Divine Son of Man Jesus Christ? #PopeFrancis #JesusChrist #LatinMass

This paper is in the public domain in USA. Metadata comes from the CrossRef API, see full record in the source URL below.

The aim of this paper is to introduce a logic in which nouns and verbs are handled together as a deductive reasoning, and also to observe the relationship between nouns and verbs as well as between logics and conversations.

Rocky's Boots (RB), an educational game developed for use with Apple computers, is widely considered to be one of the most imaginative and engaging pieces of educational software currently available. RB presents an introduction to the logical concepts of AND, OR, and NOT. Players incorporate these concepts into arguments which are modeled as "machines." This study examined: how students responded to this cognitively challenging and complex game; if they would proceed into the game without external instruction or encouragement; if students with prior computer experience were more proficient at RB; if there was any transfer of skills from RB to linguistic logic problems (or vice versa); and if it was possible to assist students in solving the more difficult problems by providing certain general hints and rules of analysis. Findings, among others, indicate that RB is an engrossing game that students found intrinsically enjoyable and that although the style of interaction with RB differs between boys and girls, both groups showed equal levels of enthusiasm and enjoyment. Recommendations for classroom use of RB (such as offering hints to students after allowing them to explore, experiment, and solve problems) and suggestions for further study are included. (JN)

PURPOSES OF THIS STUDY WERE TO EXPLORE THE FEASIBILITY OF SYMBOLIC LOGIC AS AN EXPERIMENTAL TASK TO BE PRESENTED USING PROGRAMED INSTRUCTION ON TEACHING MACHINES, TO DEVELOP A STANDARD PROGRAM AND RELIABLE CRITERION MEASURES OF ITS CONTENT, AND TO INVESTIGATE EFFECTS OF RESPONSE MODE, FEEDBACK, AND PROGRAM CONSTRUCTION ON LEARNING RATE AND ON IMMEDIATE AND DELAYED PERFORMANCE MEASURES. 6 EXPERIMENTAL GROUPS OF 10 COLLEGE STUDENTS EACH LEARNED TO CONSTRUCT LOGICAL PROOFS. 2 GROUPS USED A FORMALIZED ("RULEG") PROGRAM AND CONSTRUCTED THEIR RESPONSES TO EACH ITEM. FOR THE OTHER 4 GROUPS, WHO USED A LESS SYSTEMATIC PROGRAM, RESPONSE MODES WERE--CONSTRUCTED WITH, AND WITHOUT, IMMEDIATE FEEDBACK, MULTIPLE CHOICE, AND COVERT WITH THE CORRECT ANSWER VISIBLE FOR EACH ITEM. 3 IMMEDIATE POST-TESTS WERE GIVEN AND REPEATED AFTER ONE WEEK TO MEASURE LEARNING TIME, TESTING TIME, AND NUMBER OF ERRORS ON THE TESTS. RESULTS FOLLOW. RESPONSE MODE SIGNIFICANTLY AFFECTED LEARNING TIME AND TESTING TIME ON IMMEDIATE POST-TESTS ONLY, BUT NOT ERROR SCORES. THE RULEG PROGRAM PRODUCED, IN LESS LEARNING TIME, PERFORMANCE COMPARABLE WITH THAT OF A LESS SYSTEMATIC PROGRAM. DIFFERENTIAL RETENTION EFFECTS WERE OBSERVED AS A FUNCTION OF TYPE OF TEST. IT WAS CONCLUDED THAT THE RELEVANCE OF RESPONSE MODE AND IMMEDIACY OF FEEDBACK IS INVERSELY RELATED TO THE PROBABILITY OF CORRECT RESPONDING. (LH)

PURPOSES OF THIS STUDY WERE TO EXPLORE THE FEASIBILITY OF SYMBOLIC LOGIC AS AN EXPERIMENTAL TASK TO BE PRESENTED USING PROGRAMED INSTRUCTION ON TEACHING MACHINES, TO DEVELOP A STANDARD PROGRAM AND RELIABLE CRITERION MEASURES OF ITS CONTENT, AND TO INVESTIGATE EFFECTS OF RESPONSE MODE, FEEDBACK, AND PROGRAM CONSTRUCTION ON LEARNING RATE AND ON IMMEDIATE AND DELAYED PERFORMANCE MEASURES. 6 EXPERIMENTAL GROUPS OF 10 COLLEGE STUDENTS EACH LEARNED TO CONSTRUCT LOGICAL PROOFS. 2 GROUPS USED A FORMALIZED ("RULEG") PROGRAM AND CONSTRUCTED THEIR RESPONSES TO EACH ITEM. FOR THE OTHER 4 GROUPS, WHO USED A LESS SYSTEMATIC PROGRAM, RESPONSE MODES WERE--CONSTRUCTED WITH, AND WITHOUT, IMMEDIATE FEEDBACK, MULTIPLE CHOICE, AND COVERT WITH THE CORRECT ANSWER VISIBLE FOR EACH ITEM. 3 IMMEDIATE POST-TESTS WERE GIVEN AND REPEATED AFTER ONE WEEK TO MEASURE LEARNING TIME, TESTING TIME, AND NUMBER OF ERRORS ON THE TESTS. RESULTS FOLLOW. RESPONSE MODE SIGNIFICANTLY AFFECTED LEARNING TIME AND TESTING TIME ON IMMEDIATE POST-TESTS ONLY, BUT NOT ERROR SCORES. THE RULEG PROGRAM PRODUCED, IN LESS LEARNING TIME, PERFORMANCE COMPARABLE WITH THAT OF A LESS SYSTEMATIC PROGRAM. DIFFERENTIAL RETENTION EFFECTS WERE OBSERVED AS A FUNCTION OF TYPE OF TEST. IT WAS CONCLUDED THAT THE RELEVANCE OF RESPONSE MODE AND IMMEDIACY OF FEEDBACK IS INVERSELY RELATED TO THE PROBABILITY OF CORRECT RESPONDING. (LH)

We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control. The control consists of a selection rule (delays of Prolog) and pruning the search space. We construct the logic program together with proofs of its correctness and completeness, with respect to a formal specification. This is augmented by a proof of termination under any selection rule. Correctness and termination are inherited by the Prolog program, the change of selection rule preserves completeness. We prove that completeness is also preserved by one case of pruning; for the other an informal justification is presented. For proving correctness we use a method, which should be well known but is often neglected. A contribution of this paper is a method for proving completeness. In particular we introduce a notion of semi-completeness, for which a local sufficient condition exists. We compare the proof methods with declarative diagnosis (algorithmic debugging). We introduce a method of proving that a certain kind of pruning preserves completeness. We argue that the proof methods correspond to natural declarative thinking about programs, and that they can be used, formally or informally, in every-day programming. Keywords: logic programming, program correctness, program completeness, specification, declarative programming, declarative diagnosis.

We consider the growth of multiple-valued logic over the 21 year period from 1971 through 1991, as indicated by papers in the International Symposium on Multiple-Valued Logic. Of specific interest are: (1) trends in research topics. This includes patterns of growth and decline. We also consider (2) the demographics of the contributing authors. This includes the distribution of authors by country, the percentage of authors who are new, percentage of new authors who return, and the distribution of authors by affiliation (academia, industry, and government). To derive these statistics, we developed a database of papers, authors and topics. This can be used, for example, to do library searches or to assign papers to referees.

From the bitsavers.org collection, a scanned-in computer-related document. components :: amd :: programmable logic :: dataSheets :: 1988 29PL131

Let's admit it... Video games have a strange sense of logic! And this comic is designed to point out all the crazy and weird types of thing you see in video games! Welcome to the Logic of Video Games!

Autif Kamal talks about how talks about how a conjunctive syllogism can be converted to a conditional syllogism to focus on the causation aspect or to a disjunctive syllogism to focus on the possibilities aspect.

VEGAN LOGIC - MARCH 2017 BEST RECORDINGS SELECTION  (live on 94.9 FM Açık Radyo)

1/18/2024 8:07:25 PM with 117 Peak Viewers. Mirror:https://pomf2.lain.la/f/wjs2wawj.mp3

1/18/2024 8:07:25 PM with 117 Peak Viewers. Mirror:https://pomf2.lain.la/f/wjs2wawj.mp3

1/18/2024 8:07:25 PM with 117 Peak Viewers. Mirror:https://pomf2.lain.la/f/wjs2wawj.mp3

We study a propositional variant of Hoare logic that can be used for reasoning about programs that exhibit both angelic and demonic nondeterminism. We work in an uninterpreted setting, where the meaning of the atomic actions is specified axiomatically using hypotheses of a certain form. Our logical formalism is entirely compositional and it subsumes the non-compositional formalism of safety games on finite graphs. We present sound and complete Hoare-style calculi that are useful for establishing partial-correctness assertions, as well as for synthesizing implementations. The computational complexity of the Hoare theory of dual nondeterminism is investigated using operational models, and it is shown that the theory is complete for exponential time.

Autif Kamal talks about how to refer to something so that exactly and only one thing or location is pointed out rather than referring in a way that entails multiple possible things and locations. This subject matter pertains to being precise.

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal languages are members of the family of Description Logics, which are characterized by high expressivity combined with good computational properties. The subsumption problem for a class of temporal Description Logics is investigated and sound and complete decision procedures are given. The basic language TL-F is considered first: it is the composition of a temporal logic TL -- able to express interval temporal networks -- together with the non-temporal logic F -- a Feature Description Logic. It is proven that subsumption in this language is an NP-complete problem. Then it is shown how to reason with the more expressive languages TLU-FU and TL-ALCF. The former adds disjunction both at the temporal and non-temporal sides of the language, the latter extends the non-temporal side with set-valued features (i.e., roles) and a propositionally complete language.

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal languages are members of the family of Description Logics, which are characterized by high expressivity combined with good computational properties. The subsumption problem for a class of temporal Description Logics is investigated and sound and complete decision procedures are given. The basic language TL-F is considered first: it is the composition of a temporal logic TL -- able to express interval temporal networks -- together with the non-temporal logic F -- a Feature Description Logic. It is proven that subsumption in this language is an NP-complete problem. Then it is shown how to reason with the more expressive languages TLU-FU and TL-ALCF. The former adds disjunction both at the temporal and non-temporal sides of the language, the latter extends the non-temporal side with set-valued features (i.e., roles) and a propositionally complete language.

Discussion of Hegel's Logic Part II

A ksp mod to "hardwire"-logic (decouple, light an engine, separate a fairing(procedural, NOT squad)) into rocket designs. Homepage: https://forum.kerbalspaceprogram.com/index.php?/topic/202506-1101-1112-benjis-hardwired-logic-v11/ Repository: https://github.com/ErinaceusLinnaeus/BenjisHardwiredLogic License(s): GPL-3.0

We define (with machine-checked proofs in Coq) a modular operational semantics for Concurrent C minor—a language with shared memory, spawnable threads, and first-class locks. By modular we mean that one can reason about sequential control and data-flow knowing almost nothing about concurrency, and one can reason about concurrency knowing almost nothing about sequential control and data-flow constructs. We present a Concurrent Separation Logic with first-class locks and threads, and prove its soundness with respect to the operational semantics. Using our modularity principle, we proved the sequential C.S.L. rules (those inherited from sequential Separation Logic) simply by adapting Appel & Blazy’s machine-checked soundness proofs. Our Concurrent C minor operational semantics is designed to connect to Leroy’s optimizing (sequential) C minor compiler; we propose our modular semantics as a way to adapt Leroy’s compiler-correctness proofs to the concurrent setting. Thus we will obtain end-to-end proofs: the properties you prove in Concurrent Separation Logic will be true of the program that actually executes on the machine. ©2008 Microsoft Corporation. All rights reserved.

We define (with machine-checked proofs in Coq) a modular operational semantics for Concurrent C minor—a language with shared memory, spawnable threads, and first-class locks. By modular we mean that one can reason about sequential control and data-flow knowing almost nothing about concurrency, and one can reason about concurrency knowing almost nothing about sequential control and data-flow constructs. We present a Concurrent Separation Logic with first-class locks and threads, and prove its soundness with respect to the operational semantics. Using our modularity principle, we proved the sequential C.S.L. rules (those inherited from sequential Separation Logic) simply by adapting Appel & Blazy’s machine-checked soundness proofs. Our Concurrent C minor operational semantics is designed to connect to Leroy’s optimizing (sequential) C minor compiler; we propose our modular semantics as a way to adapt Leroy’s compiler-correctness proofs to the concurrent setting. Thus we will obtain end-to-end proofs: the properties you prove in Concurrent Separation Logic will be true of the program that actually executes on the machine. ©2008 Microsoft Corporation. All rights reserved.

We define (with machine-checked proofs in Coq) a modular operational semantics for Concurrent C minor—a language with shared memory, spawnable threads, and first-class locks. By modular we mean that one can reason about sequential control and data-flow knowing almost nothing about concurrency, and one can reason about concurrency knowing almost nothing about sequential control and data-flow constructs. We present a Concurrent Separation Logic with first-class locks and threads, and prove its soundness with respect to the operational semantics. Using our modularity principle, we proved the sequential C.S.L. rules (those inherited from sequential Separation Logic) simply by adapting Appel & Blazy’s machine-checked soundness proofs. Our Concurrent C minor operational semantics is designed to connect to Leroy’s optimizing (sequential) C minor compiler; we propose our modular semantics as a way to adapt Leroy’s compiler-correctness proofs to the concurrent setting. Thus we will obtain end-to-end proofs: the properties you prove in Concurrent Separation Logic will be true of the program that actually executes on the machine. ©2008 Microsoft Corporation. All rights reserved.

Manual for the TenPin Arcade Machine. This has been uploaded from my personal archives to ensure that the information in this document has been preserved and is not lost to history.

From the bitsavers.org collection, a scanned-in computer-related document. components :: dataquest :: 0003945 PC Logic Chip Sets--Emerging Technology and Trends 1989

From the bitsavers.org collection, a scanned-in computer-related document. megatek :: 7000 :: boards :: Unibus Intf :: Host Logic :: firmware :: 82S103

1Mother Goose in Prose

By L. Frank Baum

Whether Mother Goose was a real person or a myth, the songs that are attributed to her name are what we remember from our childhood. Some of these nursery rhymes are complete tales in themselves. There are others which are mere suggestions, leaving the imagination to weave in the details of the story. Many of the rhymes’ origins even at the time of this books writing, could be traced back decades or centuries. L Frank Baum in 1897, while living in Chicago, collected the rhymes and created short stories around them which add context and understanding for children who are drawn to the familiar melodies. (Summary by Westwinds12)

The "Little Wizard Stories of Oz" are six short stories written by L. Frank Baum in 1913. By all accounts, Baum intended to finish the Oz series with "The Emerald City of Oz," published in 1910. Following that, he attempted to write non-Oz books, publishing "The Sea Fairies" in 1911 and "Sky Island" in 1912. But, (as Baum himself laments in the prefaces of many of his Oz books,) his "little tyrants" were only interested in hearing more Oz stories. So in 1913, he returned to writing about Oz, putting out both The "Little Wizard Stories" and "The Patchwork Girl of Oz" that year. <br /><br />The Little Wizard Stories were geared toward younger children and were originally published separately, "similar in style to today's Little Golden Books." The next year, they were published together as one volume.<br /><br />Each Little Wizard Story revolves around the adventures of two famous Oz characters, and their humorous adventures in and around the land of Oz. (Summary by Maddie)

3Dorothy and the Wizard in Oz

By L. Frank Baum

Dorothy and the Wizard in Oz was the fourth of 14 Oz books written by L. Frank Baum (1856-1919). Published in 1908, while Baum was resident in Coronado, California, it is considered one of the “darker” of the Oz tales. However, it also is enlivened by Baum’s considerable wit, penchant for puns, and dry social commentary. In this title, Dorothy, her kitten Eureka, Jim, a cab horse, and Zeb, a ranch hand, descend into the earth through a rift opened by an earthquake. There they encounter the “humbug” wizard who once ruled Oz. In their journey back to the earth’s surface, they meet a number of potentially dangerous magical peoples and creatures including the cold-blooded Mangaboos, invisible bears, the flying wooden Gargoyles, a den of dragonettes, and an eccentric inventor. With a little help from Ozma, the group end up in Oz where they are treated to feasts and celebrations. The animals end up humbled by a few of their experiences in Oz, where all animals can talk, and return home a little wiser. (Summary by Judy Bieber)

4Sky Island

By L. Frank Baum

Sky Island (1912) was the second of three titles written by Baum featuring a spunky girl from California, Trot, and her companion, the old sailorman, Cap’n Bill. Baum had hoped to end the Oz series in 1910 and the following year he introduced Trot and Cap’n Bill in The Sea Fairies. In Sky Island, they journey to an island in the sky by means of an enchanted umbrella belonging to Button Bright, a character who first appeared in The Road to Oz (1909). The trio is then captured by the Boolaroo of the Blues, a monarch who is both comical and dangerous, escape to the country of the “Pinks”, and eventually regain the magic umbrella and return back to earth. This is one of Baum’s best fantasy books and contains enough not-so-veiled commentary on race and politics to interest adults as well. However, it (and The Sea Fairies) did not sell as well as the Oz books and Baum resumed writing them in 1913. He subsequently brought Trot and Cap’n Bill to Oz in 1915 in The Scarecrow of Oz. (Summary by Judy Bieber)

5Wonderful Wizard of Oz

By L. Frank Baum

The timeless story of the Wizard Of Oz. Follow Dorothy as she leaves Kansas for Oz on a cyclone. She meets many strange, and wonderful people and creatures along the way. Enjoy it again with your children and family.<br /> L. Frank Baum's classic story that has made pop culture status. Summary by J. Hall.

6Emerald City of Oz

By L. Frank Baum

The Emerald City of Oz (1910) was the sixth Oz book written by L. Frank Baum, a title he hoped would be the last. In this book, Dorothy and her impoverished Uncle Henry and Aunt Em are on the brink of losing their Kansas farm. Consequently, Ozma invites them all to live in the Emerald City. They then explore the countryside, visiting a series of strange beings including the Cuttenclips, the Fuddles, the Rigmaroles, the Flutterbudgets, and the residents of Utensia, Bunbury and Bunnybury. Aunt Em and Uncle Henry also meet old friends like the Wizard, the Cowardly Lion and the Hungry Tiger, the Scarecrow, the Tin Woodman, Jack Pumpkinhead and H. M. Wogglebug T. E. The travelers’ idyll is brought short by the plot of an old enemy, the Nome King. Seeking revenge for the loss of his magic belt, the Nome King has an underground tunnel built so he can invade and plunder Oz and enslave its peoples. Our friends manage to defeat the Nome King and his allies, but sobered by this threat, Glinda and Ozma decide to cut off Oz from the outside world forever. Happily for Oz fans, forever lasted only three years. Baum invented a way to reopen communications with Oz and eight more Oz books were published between 1913-1920. (Summary by Judy Bieber)

7Enchanted Island of Yew

By L. Frank Baum

A fairy has become bored with her life, and convinces some young girls to transform her into a human boy so she can go on adventures. The adventures come fast and furious, as the newly-named Prince Marvel explores the surrounding kingdoms. A masochistic squire accompanies Marvel, helping him with assorted kings, knights, dragons, and other medieval menaces along the way. (Summary by Ted Delorme)

8Marvelous Land of Oz

By L. Frank Baum

The Marvelous Land of Oz is the second of the Oz books. It follows the adventures of the Scarecrow, the Tin Woodman and Tip. The Emerald City has been taken over by the Army of Revolt, and our adventurous friends need the help of Glinda the Good to return it to its rightful ruler.<br />(Summary by Paul Harvey)

9Lost Princess of Oz

By L. Frank Baum

Who is stealing all the magic in Oz? Dorothy and her friends set out to comb all of Oz, not only for magic stolen from Glinda and the Wizard, but also for the kidnapped princess, Ozma. Along the way, they explore regions never seen in other Oz books, meeting strange and interesting people and animals, and falling into peril more than once. It’s a desperate mission – for if the thefts are all linked, then it means that some magician unknown to them has acquired powers beyond any available to them now. How will they find him? And how will they conquer him? Not one of them knows – but with continuing faith that goodness will triumph, they march forth to try. (Summary by Mark)

10Road to Oz

By L. Frank Baum

The Road to Oz takes Dorothy and her friends on an adventure in Oz to a grand party in honor of Ozma's birthday. It all starts near her home on Uncle Henry's farm in Kansas when she tries to help a shaggy stranger find the road he is seeking. On the way they find a young boy, Button-Bright, and together they get lost, only to find themselves in the fairylands of Oz.<br /><br /> Once again in the Land of Oz, Dorothy and her friends encounter a number of new fantasy characters: some good, some bad, some amusing, and all entertaining. They make their way eventually to the Emerald City to participate in Ozma's Birthday Celebration. In the end, Dorothy arrives safely back home, a little tired from her adventures, but quite content.<br /> (Summary written by Kara Shallenberg)

11Life and Adventures of Santa Claus

By L. Frank Baum

This story of Santa Claus veers away slightly from the traditional stories of his beginnings. L. Frank Baum creates a world of fantasy that surrounds Santa Claus's life. Orphaned at an infant he is found by the nymph Necile, who convinces the great Ak to allow her to raise Claus for her own. As he grows older he meets his fellow humans, and sees the neglect of children. This sets him on the path to making toys and becoming the beloved Saint Nicholas we are familiar with today. (summary by Kri)

12Master Key

By L. Frank Baum

The Master Key was one of Baum's earliest full length fantasy books for children, published in 1901 just one year after The Wonderful Wizard of Oz. The protagonist, Rob, while experimenting in his workshop, accidentally summons up an electrical fairy who presents him with electrical devices so advanced as to seem magical. His gifts include a flying contraption, a stun gun, and something resembling an omniscient portable TV set. Rob travels the world, rendering assistance to European heads of state and narrowly escaping disaster at the hands of “primitive” cannibals, Turks and Tatars, pirates, and evil scientists who try to steal his inventions. It's great fun, despite the occasional use of racial stereotypes that reflect the values of its time.

13Ozma of Oz (Version 2) (Dramatic Reading)

By L. Frank Baum

<i>Ozma of Oz</i> was the third title in the Oz series by L. Frank Baum. In this book Dorothy is shipwrecked and lands on the shores of a fairy country that adjoins Oz, the land of Ev. There she meets Tiktok, a wind-up mechanical man; a talking chicken, Billina; and Ozma, the girl ruler of Oz who is leading a quest to rescue the royal family of Ev from their captivity by the Nome King. Dorothy is also reunited with her old friends, the Scarecrow, the Tin Woodman, and the Cowardly Lion. Together the adventurers travel to the Nome King’s underground kingdom and have many exciting adventures before returning to Oz, and for Dorothy, eventual return to her family in the “civilized” world. (Summary by Judy Bieber)<br><br><strong>Cast:</strong><br><br>Narrators: <a href="http://librivox.org/reader/335">Paul Harvey</a>, <a href="http://librivox.org/reader/3012">staticstasy</a>, <a href="http://librivox.org/reader/2911">David Lawrence</a>, <a href="http://librivox.org/reader/19">Kara Shallenberg</a>, <a href="http://librivox.org/reader/3994">Miriam Esther Goldman</a>, <a href="http://librivox.org/reader/3157">TriciaG</a>, <a href="http://librivox.org/reader/3830">rymd80</a>, & <a href="http://librivox.org/reader/204">Mark F. Smith</a><br>Dorothy Gale: <a href="http://amingledyarn.wordpress.com/">Elizabeth Klett</a><br>Billina the Chicken, Sawhorse: <a href="http://librivox.org/reader/3994">Miriam Esther Goldman</a><br>Wheelers, Leader of the Wheelers, Big Red Colonel, Hungry Tiger, The Nome King: <a href="http://wulongti.com/blog/">Christian Brock</a><br>TikTok the Machine Man, General 1: <a href="http://www.techsmiths.blogspot.com/">Mark F. Smith</a><br>Nanda the Maid & Glinda: <a href="http://www.raeganpayne.com/">Raegan Payne</a><br>Princess Langdiwere & Queen of Ev: <a href="http://librivox.org/reader/3157">TriciaG</a><br>Scarecrow: <a href="http://librivox.org/reader/2045">David O'Connell</a><br>Ozma of Oz: <a href="http://librivox.org/reader/3012">staticstasy</a><br>Tin Woodman: <a href="http://librivox.org/reader/26">Denny Sayers</a><br>Cowardly Lion: <a href="http://librivox.org/reader/2588">Padraig O'hIceadha</a><br>General 2, Private Omby Amby, Nome Captain: <a href="http://librivox.org/reader/4130">Matt L Speer</a><br>Captain, Chief Steward, Major, Uncle Henry: <a href="http://librivox.org/reader/3664">Barry Eads</a><br>Prince Evring: <a href="http://librivox.org/reader/21">Henry Frigon</a><br>Jinjur & Jellia Jamb: <a href="http://librivox.org/reader/4156">Caroline Shapiro</a><br>General 3: <a href="http://librivox.org/reader/6032">Beverly Scott</a><br><br> Editors: Jennifer Stearns & TriciaG <br>Meta-Coordinator/Cataloging: Jc Guan & TriciaG

14Tik-Tok of Oz

By L. Frank Baum

Betsy Bobbin encounters many strange and exciting adventures and people in the land of Oz; a side-plot is Queen Ann of Oogaboo's mission to take over Oz. (Summary by Ryan T.)

15Patchwork Girl of Oz

By L. Frank Baum

An unlucky Munchkin boy named Ojo must travel around Oz gathering the ingredients for an antidote to the Liquid of Petrifaction which has turned his beloved uncle Unc Nunkie and the wife of the Liquid's creator into marble statues. Ojo is joined by the patchwork girl Scraps, Dorothy, Dr. Pipt's Glass Cat, the Woozy, the Shaggy Man, the Scarecrow and the Tin Woodman. They eventually visit the Emerald City to ask for help from the Wizard of Oz. (Summary by Daniel Anaya)

16Ozma of Oz

By L. Frank Baum

Ozma of Oz was the third title in the Oz series by L. Frank Baum. In this book Dorothy is shipwrecked and lands on the shores of a fairy country that adjoins Oz, the land of Ev. There she meets Tiktok, a wind up mechanical man, a talking chicken, Billina, and Ozma, the girl ruler of Oz who is leading a quest to rescue the royal family of Ev from their captivity by the Nome King. Dorothy is also reunited with her old friends, the Scarecrow, the Tin Woodman, and the Cowardly Lion. Together the adventurers travel to the Nome King's underground kingdom and have many exciting adventures before returning to Oz, and for Dorothy, eventual return to her family in the "civilized" world. (description by Judy Bieber)

17Scarecrow of Oz

By L. Frank Baum

The Scarecrow of Oz is the ninth book set in the Land of Oz written by L. Frank Baum. Published on July 16, 1915, it was Baum's personal favorite of the Oz books and tells of Cap'n Bill and Trot journeying to Oz and, with the help of the Scarecrow, overthrowing the cruel King Krewl of Jinxland. (Summary from Wikipedia)<br><br> Narrated by <a href="http://librivox.org/reader/92">Cori Samuel</a>, <a href="http://librivox.org/reader/319">Ed Good</a>, <a href="http://librivox.org/reader/20">Gesine</a>, <a href="http://librivox.org/reader/19">Kara Shallenberg</a>, <A href="http://librivox.org/reader/1373">Kira Belkin</a>, <a href="http://librivox.org/reader/1637">Kelly Harmon</a>, <a href="http://librivox.org/reader/1638">K.O. Munley</a>, <a href="http://librivox.org/reader/681">Lucy Burgoyne</a>, <a href="http://librivox.org/reader/1644">Timothy H. VanderWall</a>, <a href="http://librivox.org/reader/1611">Patrick Beverley</a>, <a href="http://librivox.org/reader/1595">Riccardo</a>, and <a href="http://librivox.org/reader/1313">Scott Sherris</a>. <br><br> Characters performed by <a href="http://librivox.org/reader/1565">Abigail & Adam Flach</a>, <a href="http://librivox.org/reader/1485">Robert Flach</a>, <a href="http://librivox.org/reader/1901">Allyson Hester</a>, <a href="http://librivox.org/reader/1549">Jamie Wilking</a>, <a href="http://librivox.org/reader/56">Kirsten Ferreri</a>, <A href="http://librivox.org/reader/1542">Chip Joel</a>, <a href="http://librivox.org/reader/123">Ezwa</a>, <a href="http://librivox.org/reader/125">Claire Goget</a>, <a href="http://librivox.org/reader/21">Henry Frigon</a>, <a href="http://librivox.org/reader/78">Hugh McGuire</a>, <a href="http://librivox.org/reader/589">Stephanie König</a>, <a href="http://librivox.org/reader/204">Mark F. Smith</a>, <a href="http://librivox.org/reader/207">Kevin McAsh</a>, <a href="http://librivox.org/reader/1379">Ken Crooker</a>, <A href="http://librivox.org/reader/1457">Laura Brodrick</a>, <a href="http://librivox.org/reader/1151">Ada Kerman</a>, <a href="http://librivox.org/reader/1445">Michael Yard</a>, <a href="http://librivox.org/reader/684">Lizzie Driver</a>, <a href="http://librivox.org/reader/1507">Saul</a>, <a href="http://librivox.org/reader/1456">Jason Isbell</a>, <a href="http://librivox.org/reader/937">Susie G.</a>, and <a href="http://librivox.org/reader/1706">Talia Fishman</a>.

18Rinkitink in Oz

By L. Frank Baum

Rinkitink in Oz is the tenth book in the Oz series written by L. Frank Baum, first published in 1916. It was originally written in 1905 as a stand alone fantasy work and subsequently rewritten as an Oz book. Therefore, most of the action takes place outside of Oz in neighboring fairy countries. It tells the story of Prince Inga's quest to rescue his parents from captivity after his island home is ravaged by enemies. With the help of three magical pearls and the more dubious assistance of the excessively jolly King Rinkitink and his surly goat, Bilbil, his travels lead him to the underground caverns of the Nome King where he is united with some people from Oz who help him to free his parents and restore his island kingdom. (description written by Judy Bieber)

19Tin Woodman of Oz

By L. Frank Baum

The Tin Woodman of Oz is the twelfth Land of Oz book written by L. Frank Baum and was originally published on May 13, 1918. The Tin Woodman is unexpectedly reunited with his Munchkin sweetheart Nimmie Amee from the days when he was flesh and blood. This was a backstory from The Wizard of Oz. (Summary from Wikipedia)

20Rinkitink in Oz (version 2)

By L. Frank Baum

Prince Inga lives a happy life on the island of Pingaree until one day invaders from the north enslave every person on the island, including his parents. Inga, who escaped unnoticed in an apple tree, visiting King Rinkitink who had fallen in a well, and surly talking donkey Bilbil embark on a quest to save the Pingareeans. <br/> Armed only with three magic pearls that imbue strength, invincibility, and wisdom, the three take on the open sea, the military might of the islands of Regos and Coregos, and the Nome King. <br/>(Summary by Scott Sherris)<br /><br /> Narrated by : <a href="http://librivox.org/newcatalog/people_public.php?peopleid=3179" rel="nofollow">Robin</a>, <a href="http://kayray.org/" rel="nofollow">Kara Shallenberg</a>, <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=319" rel="nofollow">Ed Good</a>, <a href="http://www.julianmackintosh.com/" rel="nofollow">Julian Mackintosh</a>, <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=110" rel="nofollow">Cynthia Lyons</a>, <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=1754" rel="nofollow">Joan Freeman</a>, <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=1649" rel="nofollow">Kalynda</a>, <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=1373" rel="nofollow">Kira Belkin</a>, <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2090" rel="nofollow">Melissa</a>, <a href="http://www.techsmiths.blogspot.com/" rel="nofollow">Mark F. Smith</a> and <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2376" rel="nofollow">Sy</a>. <br /><br /> <u>Cast of Characters :</u> <br /> - <b>King Kitticut</b> (chapters 01-03, 17, 23 & 24) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=1795" rel="nofollow">Muhammad Mussnoon</a><br /> - <b>Prince Inga</b> (chapters 01-08, 10, 13-16, 18, 21, 24) read by <a href="http://spaceman3000.blogspot.com/" rel="nofollow">Henry Frigon</a><br /> - <b>The White Pearl</b> (chapters 01, 05, 08, 14 & 18) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2481" rel="nofollow">Alana Jordan</a> <br /> - <b>Rinkitink</b> (chapters 02-08, 10, 13, 14, 16, 18, 19, 21-24) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2134" rel="nofollow">Angleet</a> <br /> - <b>Bilbil</b> (chapters 02-08, 13, 14, 16, 19, 21 & 24) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2358" rel="nofollow">Chugosh</a> <br /> - <b>The Regos Warriors</b> (chapters 03, 07 & 14) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2588" rel="nofollow">Padraig O'hIceadha</a> <br /> - <b>The Palace Maid</b> (chapter 08) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2682" rel="nofollow">onemagdelen</a> <br /> - <b>Nikobob</b> (chapters 09, 11 & 16) read by <a href="http://librivox.org/sandpit/librivox_catalog - " rel="nofollow">Marion</a> <br /> - <b>Zella's Mother</b> (chapter 09) read by <a href="http://www.kermanenterprises.com/" rel="nofollow">Ada Kerman</a> <br /> - <b>Queen Cor</b> (chapters 10, 13, 15 & 17) read by <a href="http://members.shaw.ca/jcmlott/" rel="nofollow">Jennifer Lott</a><br /> - <b>King Gos</b> (chapters 10, 12, 15 & 17) read by <a href="http://guitarsthatsmoke.tripod.com/" rel="nofollow">Colin McRoberts</a> <br /> - <b>The Slave Woman</b> (chapter 13) read by <a href="http://librivox.org/sandpit/librivox_catalog/people.php?peopleid=1706" rel="nofollow">Talia Fishman</a> <br /> - <b>The Mine Guards</b> (chapter 14) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=123" rel="nofollow">Ezwa</a> <br /> - <b>King Kaliko</b> (chapters 17, 18, 19 & 21) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2140" rel="nofollow">Ralph Snelson</a> <br /> - <b>Klik</b> (chapters 17, 18 & 21) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2164" rel="nofollow">Ellie Trachtenberg</a> <br /> - <b>The Long Eared Hearer</b> (chapter 17) read by <a href="http://librivox.org/sandpit/librivox_catalog/people.php?peopleid=4240" rel="nofollow">Judith</a> <br /> - <b>The Nome Lookout</b> (chapter 17) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2966" rel="nofollow">Niamh</a> <br /> - <b>The Giant</b> (chapter 18) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=1378" rel="nofollow">Paul Williams</a> <br /> - <b>Dorothy</b> (chapters 20, 21 & 24) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=937" rel="nofollow">Susie G.</a> <br /> - <b>Princess Ozma</b> (chapter 20) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2353" rel="nofollow">Mira Trachtenberg</a> <br /> - <b>The Wizard of Oz</b> (chapter 21) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2588" rel="nofollow">Padraig O'hIceadha</a> <br /> - <b>Pinkerbloo</b> (chapter 24) read by <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=3242" rel="nofollow">peac</a><br /><br /> In addition to the readers, this audio book was produced by:<br /><a href="http://wiki.librivox.org/index.php/Glossary#BC" rel="nofollow">Book Coordinators</a>: <a href="http://librivox.org/sandpit/librivox_catalog/people.php?peopleid=1313" rel="nofollow">Scott Sherris</a> and <a href="http://librivox.org/sandpit/librivox_catalog/people.php?peopleid=2588" rel="nofollow">Padraig O'hIceadha</a><br /><a href="http://wiki.librivox.org/index.php/Guide_for_Proof-listeners" rel="nofollow">Dedicated Proof-Listeners</a>: <a href="http://librivox.org/sandpit/librivox_catalog/people.php?peopleid=2142" rel="nofollow">annelika</a> <a href="http://librivox.org/sandpit/librivox_catalog/people.php?peopleid=243" rel="nofollow">Jennifer Stearns</a> and <a href="http://librivox.org/sandpit/librivox_catalog/people_public.php?peopleid=2134" rel="nofollow">Angleet</a><br /><a href="http://wiki.librivox.org/index.php/Glossary#MC" rel="nofollow">Meta-Coordinators/Cataloging</a>: <a href="http://librivox.org/sandpit/librivox_catalog/people.php?peopleid=1313" rel="nofollow">Scott Sherris</a> and <a href="http://librivox.org/sandpit/librivox_catalog/people.php?peopleid=123" rel="nofollow">Ezwa</a>

21Glinda of Oz

By L. Frank Baum

Glinda of Oz is the fourteenth Land of Oz book and is the last one written by the original author L. Frank Baum, although the series was continued after his death by several other authors.<br /><br />Dorothy and Ozma discover that a war is brewing in a distant and unexplored part of Oz, between two mysterious races, the Flatheads and the Skeezers. The girls set out to try to prevent the fighting, not knowing what dangers await them. (Summary by Lucy Perry.)

22Magic of Oz

By L. Frank Baum

L. Frank Baum's last beloved Oz book before his death, this story deals with the discovery of a powerful magic word by a young boy from Oz, who immediately is plunged head-first into adventure through his discovery. (Summary by Piper Hale)

23Sea Fairies

By L. Frank Baum

In 1910, Baum hoped to end the Oz series and follow with a new series about a little girl named Trot and her sailor companion, Cap'n Bill. The Sea Fairies (1911) was the first book in the projected series and took Trot and Cap'n Bill under the sea where they had adventures with mermaids and other fantastic creatures. It was followed by Sky Island (1912) and then Baum returned to the Oz titles. He brought Trot and Cap'n Bill to Oz in the Scarecrow of Oz (1915). (Summary by Judy Bieber)

24Wonderful Wizard of Oz (version 3) (Dramatic Reading)

By L. Frank Baum

The timeless story of the Wizard Of Oz. Follow Dorothy as she leaves Kansas for Oz on a cyclone. She meets many strange, and wonderful people and creatures along the way. Enjoy it again with your children and family. (Summary by J. Hall) <br /> <br /> Characters: <ul> <li>Aunt Em: <a href="http://librivox.org/reader/2895">jenny</a></li> <li>Dorothy: <a href="http://librivox.org/reader/1401">Sibella</a></li> <li>The Scarecrow: <a href="http://librivox.org/reader/204">Kaffen</a></li> <li>The Tin Woodman: <a href="http://librivox.org/reader/26">DSayers</a></li> <li>The Cowardly Lion: <a href="http://librivox.org/reader/2588">padraigo </a> </li> <li>The Witch of the North: <a href="http://librivox.org/reader/2895">jenny</a></li> <li>Munchkin 1: <a href="http://librivox.org/reader/2748">Annoying Twit</a></li> <li>Munchkin 2: <a href="http://librivox.org/reader/2911">aradlaw</a></li> <li>Munchkin 3: <a href="http://librivox.org/reader/2301">Iowajones</a></li> <li>The Wizard of Oz: <a href="http://librivox.org/reader/94">earthcalling</a></li> <li>Guardian of the Gates: <a href="http://librivox.org/reader/2825">Ernst Pattynama</a></li> <li>Soldier: <a href="http://librivox.org/reader/3513">Symmie</a></li> <li>The Wicked Witch of the West: <a href="http://librivox.org/reader/2607">RuthieG</a></li> <li>The Queen of the Field Mice: <a href="http://librivox.org/reader/1545">Hayflake</a></li> <li>Several Mice: <a href="http://librivox.org/reader/3513">Symmie</a></li> <li>Stork: <a href="http://librivox.org/reader/2895">jenny</a></li> <li>Man: <a href="http://librivox.org/reader/3077">jeremiahbritt</a></li> <li>Woman: <a href="http://librivox.org/reader/2592">echobase77</a></li> <li> Green girl: <a href="http://librivox.org/reader/2966">niamh</a></li> <li>Person of the Court: <a >joyseternal</a></li><li>Leader of the Wolves: <a >henry</a></li><li>King Crow: <a >henry</a></li><li>Person of the Emerald City: <a >staticstasy</a></li><li>China Princess: <a >Iowajones</a></li><li>Clown: <a >victoria_8674</a></li><li>Tiger: <a >henry</a></li><li>Strange Man: <a >MHAIJH85</a></li><li>Farmer's Wife: <a >staticstasy</a></li><li>Young Girl: <a >niamh</a></li><li>Glinda the Good Witch: <a >sadclown</a></li><li>Monkey King: <a >henry</a></li><li>Boq the Munchkin: <a >chris123</a></li><li>Big Mouse: <a >Symmie</a></li><li>Milkmaid: <a >ReadsALott</a></li></ul>

25Marvelous Land of Oz (version 2) (Dramatic Reading)

By L. Frank Baum

The Marvelous Land of Oz Being an account of the further adventures of the Scarecrow and Tin Woodman and also the strange experiences of the highly magnified Woggle-Bug, Jack Pumpkin-head, the Animated Saw-Horse and the Gump; the story being A Sequel to The Wizard of Oz. (Summary by L. Frank Baum) <br><br><strong>Cast</strong>:<br> Narrator: <a href="https://librivox.org/reader/3912">Bob Neufeld</a><br>Tip, Ozma: <a href="https://librivox.org/reader/7315">Charlotte Duckett</a><br>Mombi: <a href="https://librivox.org/reader/8410">Shauna Kennett</a><br>Jack Pumpkinhead: <a href="https://librivox.org/reader/8266">Jeff K.</a><br>Saw-Horse, Sad-Looking Man: <a href="https://librivox.org/reader/8009">Frances Brown</a><br>Ferryman: <a href="https://librivox.org/reader/8417">Andy Cotterly</a><br>Guardian of the Gates: <a href="https://librivox.org/reader/8394">Matthew Walker</a><br>Soldier with the Green Whiskers: <a href="https://librivox.org/reader/7867">nomorejeffs</a><br>Scarecrow: <a href="https://librivox.org/reader/8169">tovarisch</a><br>Jellia Jamb, Army of Girls, Townsperson: <a href="https://librivox.org/reader/3157">TriciaG</a><br>General Jinjur: <a href="https://librivox.org/reader/1259">Elizabeth Klett</a><br>Winkie Man: <a href="https://librivox.org/reader/6065">David Olson</a><br>Tin Woodman: <a href="https://librivox.org/reader/8108">drakaunus</a><br>Mr. Woggle-Bug: <a href="https://librivox.org/reader/6281">Beth Thomas</a><br>Queen of the Mice: <a href="https://librivox.org/reader/6319">thestorygirl</a><br>Gump: <a href="https://librivox.org/reader/8291">Elliot Gage</a><br>Captain, Townsperson: <a href="https://librivox.org/reader/8396">gloriousjob</a><br>Glinda: <a href="https://librivox.org/reader/6544">Amanda Friday</a><br>Girl of the Army: <a href="https://librivox.org/reader/3885">Elli</a><br>Guard of the Army of Girls: <a href="https://librivox.org/reader/8197">Victoria P</a><br><br>Additional Book Coordinator: <a href="https://librivox.org/reader/5471">ElleyKat</a><br><br>Edited By: <a href="https://librivox.org/reader/8009">Frances Brown, <a href="https://librivox.org/reader/8072">Kimberly Krause, and <a href="https://librivox.org/reader/6892">Piotr Nater</a>